I have a template binary search tree and have to create 2 trees.
I am not sure how it is done and how the BSTree class distinguishes between them.
Any help would be greatly appreciated.Code:template <class T> class BSTree { public: BSTree (){root=NULL; deleted=0;}; ~BSTree (){clear(root);} int isEmpty () const {return root==NULL;} T retrieveData (T& data); void insertData (const T& data); void deleteData (const T& data); void printBSTree (); protected: void clear (BTNode<T> *treeRoot); void deleteHelper (BTNode<T> *&treeRoot, const T& data); void insertHelper (BTNode<T> *&treeRoot, const T& data); void printInOrder (BTNode<T> *treeRoot); T retrieveHelper (BTNode<T> *treeRoot, T& data); BTNode<T> *root; int deleted; }; //---------------------------------------- class car { .... .... }; //---------------------------------------- class Bike { .... .... };
Cheers
Sophie