
Construct a binary search tree by inserting words into an empty tree. "cut your coat according to your cloth" Visit the tree using all three traversal algorithms and list the output sequence for each algorithm. get a word from the user and search the level/levels of that word. refer split() to separate a string into pieces of strings.