Discussion:
Q: Develop some binary tree routines in C++ that will handle single word data. The binary tree will be maintained as an ordered tree.
The routines I need are:
Add - add a new word to tree (do not allow duplicates).
Search - look up a word in the tree and indicate if the word is in the structure or not.
Traverse (in-order, pre-order, post-order) - label tree output with traversal order used to print the tree.