// BSTiter.cc
// Class implementation file for binary search tree with iterator class

// Incomplete file
// Sections to be completed marked with comments beginning //*****

#include "BSTiter.h"

BSTWithIter::iterator::iterator()
  : Cur(0), S()
{}

BSTWithIter::iterator::iterator(const iterator& Iter)
  : Cur(Iter.Cur), S(Iter.S)
{}

//**** ADD =, ++ (pre and post), == and != *****

BSTWithIter::iterator BSTWithIter::begin() const
{
  //***** IMPLEMENTATION GOES HERE *****
}

BSTWithIter::iterator BSTWithIter::end() const 
{ 
  iterator newIter;   // default has Cur == 0 
  return newIter;
}