Binary Search Tree- Need Advice
I have create a binary search tree, which holds pointers to comparable datatypes.
the Tree is templated so that the user can specify what data type will be held
That much wasnt a problem, my tree works.
What i need help on is what should i do to it next? this is solely a personal project that i'm doing for educational purposes
I figured i could write a balance member for tree to analyze and balance my tree.
What else can be done?
Also, i want to have an easier way to input test data.
current i am using the command line to do the following
c:\>bintree > testdata.txt
which works fine for the input portion of my test driver, but when my program gets to the point where user should enter a number to look up, it just keeps inputting garbage.
Attached are Node.cpp Tree.cpp and Main.cpp
Main is a test driver for the class
the class test is just one i made that is comparable (suports > < == )
any insight would be nice