Use your B-tree class template from Exercise 26 in a program that reads words and constructs a B-tree to store these words. The program should then allow the user to enter a word and should search the B-tree for this word.
Exercise 26,
Ask you to develop class templates for various trees. You should also write driver programs to test your answers as instructed at the end of this chapter.
Develop a class template for general search trees that uses a binary tree to represent the tree as described in the text.