Develop a program to read a list of words as input. As these words are read store them into a dynamically allocated binary search tree.
After all words are stored do a "pre-order" traversal of the tree.
Then do an "in-order" traversal of the tree.
Then do a "post-order" traversal of the tree.
You can have the user enter the words at the keyboard, or you can put the words into a text file and read them from the file. In either case use the following words as input, in the order shown.
polymorphism
object
templates
structure
class
pointer
reference
traversal
inheritance
exceptions
recursive
overloading