(Binary Search Tree of Strings)Write a program based on the program of Fig. that inputs a...

(Binary Search Tree of Strings)Write a program based on the program of Fig. that inputs a line of text, tokenizes the sentence into separate words, inserts the words in a binary search tree, and prints the inorder, preorder, and postorder traversals of the tree.

[Hint: Read the line of text into an array. Use strtok to tokenize the text. When a token is found, create a new node for the tree, assign the pointer returned by strtok to member string of the new node, and insert the node in the tree.]

Figure Creating and traversing a binary tree.