1. Crate a template for Binary Search Tree.
2. We don't use the ADT from the book, which uses iterative algorithms and a key field.
3. See LEC12.doc and LEC14-15.doc
4. last two statements in Search should have a return. e.g. return Search(t->LeftChild, x);
5. Modify the template for BSTree in binary.h and btnode2.h
6. Add an extra data member called parent in btnode2.h
7. Add an extra data member called current in BSTree
8. Modify the constructors for BSTree and BinaryTreeNode to account for two additional data members
9. Modify the private insert so that it takes three parameters as shown in LEC14-15.doc
10. Modify the prune as shown in LEC14-15.doc
11. Make sure that you have appropriate return statements for Insert and Delete
12. Test the template using the driver program for Assignment #2.
13. Use Binary Search Tree istead of Hash Table. - You will have to omit the output operator for BSTree for this lab.
14. When we do the class assignment, we will fix this problem.