// Bstplus.h
// 	A binary search tree that is publically derived from Bst

#ifndef BSTPLUS_CLASS
#define BSTPLUS_CLASS

#include <string>
#include "Bst.h"
#include "myExceptions.h"
#include "BstIterator.h"

template <class T>
class Bstplus : public Bst<T> {
  private:
    BstIterator<T> it;

  public:
    // default constructor
    // initializes root to NULL
    Bstplus();

    // constructor with Pair and pointers left and right
    Bstplus(T p,ModNode<T> * lt,ModNode<T> * rt);

    // copy constructor
    // makes a copy of "other"
    // calls copy()
    Bstplus(const Bstplus & other);

    // destructor
    // calls makeEmpty()
    ~Bstplus();

    // explicitly defined assignment operator
    Bstplus & operator=(const Bstplus &);

    // points to the smallest node in the bst
    BstIterator<T> begin();

    // points to the largest node in the tree
    BstIterator<T> end();

  private:

    // YOU MAY WRITE ANY OTHER PRIVATE METHODS THAT YOU NEED

};

#endif // BSTPLUS_CLASS