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

) A singly linked list contains n - 1 strings that are binary representations of numbers from the set {0, 1,.…, n – 1} where n is an exact power of 2. However, the string corresponding to one of the numbers is missing. For example, if n = 4, the list will contain any three strings from 00, 01, 10 and 11. Note that the strings in the list may not appear in any specific order. Also note that thelength of each string is lgn, hence the time to compare two strings in O(lgn). Write an algorithmthat generates the missing string in O(n).

(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