(Binary Tree of Strings) Write a program based on Figs.19.20–19.22 that inputs a line of t...

(Binary Tree of Strings) Write a program based on Figs.19.20–19.22 that inputs a line of text, tokenizes the sentence into separate words (you may want to use the istringstream library class), inserts the words in a binary search tree and prints the inorder, preorder and postorder traversals of the tree. Use an OOP approach.

Fig. 19.20 Creating and traversing a binary tree. (Part 1 of 3.)

Fig. 19.20 Creating and traversing a binary tree. (Part 2 of 3.)

Fig.19.20 Creating and traversing a binary tree. (Part 3 of 3.)

Fig.19.21 TreeNode class-template definition. (Part 1 of 2.)

Fig. 19.21 TreeNode class-template definition. (Part 2 of 2.)

Fig. 19.22 Tree class-template definition. (Part 1 of 3.)

Fig. 19.22 Tree class-template definition. (Part 2 of 3.)

Fig. 19.22 Tree class-template definition. (Part 3 of 3.)