Program plan: line, token variables are used for input. There is structure Treenode having data, leftptr, rightptr member variables which represent the tree node. void insertnode(node **ptr, char value) function inserts the node in the tree. void preorder(node ptr) function displays the contents of the tree in a preorder fashion. void inorder(node ptr) function displays the contents of the tree in an in-order fashion. void postorder(node ptr) function display the contents of the tree in a post-order fashion. Program description: The main purpose of the program is to create a tree from the line entered by the user and split it into the word. Then these words are inserted into the tree. This created tree contents are displayed in preorder, inorder and postorder fashion.

Question

Want to see the full answer?

Answer 1

Question

Chapter 12, Problem 12.17E

Program Plan Intro

Program plan:

line, token variables are used for input. There is structure Treenode having data, leftptr, rightptr member variables which represent the tree node.

void insertnode(node **ptr, char value) function inserts the node in the tree.

void preorder(node ptr) function displays the contents of the tree in a preorder fashion.

void inorder(node ptr) function displays the contents of the tree in an in-order fashion.

void postorder(node ptr) function display the contents of the tree in a post-order fashion.

Program description:

The main purpose of the program is to create a tree from the line entered by the user and split it into the word. Then these words are inserted into the tree. This created tree contents are displayed in preorder, inorder and postorder fashion.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

(Please Help. My professor did not teach us any of this and will not answer my emails) Design a class named Queue for storing integers. Like a stack, a queue holds elements. In a stack, the elements are retreived in a last-in-first-out fashion. In a queue, the elements are retrieved in a first-in-first-out fashion. The class contains: An int[] data field named elements that stores the int values in the queue A data field named size that stores the number of elements in the queue A constructor that creates a Queue object with defult capacity 8 The method enqueue(int v) that adds v into the queue The method empty () that returns true if the queue is empty The method getSize() that returns the size of the queue

(True/False): Arrays are passed by reference to avoid copying them onto the stack

(Java) How can I implement a binary search tree in a program to store data, and use the delete method to trim the tree? The program should have a 'populate' button that obtains a string from the user, creates a sorted binary search tree of characters, and prints the tree using the DisplayTree class. It should also print the characters on one line in sorted order by traversing the tree in inorder fashion. The program should also have a 'Trim Tree' button that obtains a second line of input to delete characters from the tree, trimming the tree accordingly. It should ignore characters that are not in the tree, and only delete one character for each occurrence in the second line of input. When all characters from the second line have been deleted from the tree, the program should print the remaining characters in the tree using the DisplayTree class. The output should be labeled appropriately, and no spaces or commas should be used between tree elements in the inorder traversal.Here is the…