Design and implement a class named StringTree, a binary tree for storing String objects in alphabetic order. Each node in the tree should be represented by a Node class, which stores the string value and pointers to the right and left child nodes. For any node value in the tree, the value of its left child should come before that value, and the value of its right child should come after that value. The StringTree class should contain both a method for adding strings to the tree and a method for printing the tree’s value in alphabetic order. Write a driver program that reads strings from a file (one per line) and adds them to the tree. After processing the input, print the tree values.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.