Program plan: item variable is used for input. There is structure Treenode having data, leftptr, rightptr member variables which represents 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 input entered by user. This violates the binary tree insertion rule and allows the user to enter the duplicate values as well. Then the created tree contents are displayed in preorder, inorder and postorder fashion.

Question

1001 UnaI (p E. Write a program named as ProblemE_.cpp that constructs a BST from a given postorder traversal of that tree. For example, if the given traversal is {1, 7, 5, 50, 40, 10}, then the output should be the tree shown in Problem 3. Hints: • Write a recursive function to do the followings: a) Get the last element of the array and make it root of the BST. b) Find the index i such that the value in i-1 is the first value smaller than the root. c) Recursively call a function to do the same for left subarray (1 .. i-1) and right subarray (i..size-2). i) Get the last element of right half and make it right child of the root created in step a. ii) Get the last element of left half and make it left child of the root created in step a. d) return root.

Answer 1

Question

Chapter 12, Problem 12.16E

Program Plan Intro

Program plan:

item variable is used for input. There is structure Treenode having data, leftptr, rightptr member variables which represents 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 input entered by user. This violates the binary tree insertion rule and allows the user to enter the duplicate values as well. Then the created tree contents are displayed in preorder, inorder and postorder fashion.

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Students have asked these similar questions

1001 UnaI (p E. Write a program named as ProblemE_.cpp that constructs a BST from a given postorder traversal of that tree. For example, if the given traversal is {1, 7, 5, 50, 40, 10}, then the output should be the tree shown in Problem 3. Hints: • Write a recursive function to do the followings: a) Get the last element of the array and make it root of the BST. b) Find the index i such that the value in i-1 is the first value smaller than the root. c) Recursively call a function to do the same for left subarray (1 .. i-1) and right subarray (i..size-2). i) Get the last element of right half and make it right child of the root created in step a. ii) Get the last element of left half and make it left child of the root created in step a. d) return root.

( Solve it by using Scanner ) Using Binary search tree write a Java program to Insert and print the element in (in-Order traversal ), then search the elements (a and z) in the tree.

6. Symbolize the following statement in P (be sure to include your translation key). 'Every forest is full of trees.'