Program plan: Item, root variablesare used for input. There is structure Treenode havingdata, leftptr, rightptrmember variables which represents the tree node. Structure qitem having treenode, nextPtrvariables which represents the queue and stores the Treenodetype value. voidinsertnode(node **ptr, int value) function inserts the node in the tree and create a tree. voidinorder(node ptr) function displays the tree values in sorting order. voidpreorder (node ptr) function displays the tree values in pre order fashion. voidpostorder(node ptr) function displays the tree values in post order. voidlevelorder(node ptr) function display the tree values in sorting order. voidenque(queue front, queue taiil, node tnode) function stores the Treenodetype data in a queue. nodedeque(queue front, queue tail) function delete the Treenode type from the queue and return the Treenode type value. Program description: The main purpose of the program is to create binary search tree and display the tree value using levelorder algorithm . It then compares the output of this algorithm with the preoder, inorder and postorder output.

Question

Want to see the full answer?

Answer 1

Question

Chapter 12, Problem 12.23E

Program Plan Intro

Program plan:

Item, root variablesare used for input. There is structure Treenode havingdata, leftptr, rightptrmember variables which represents the tree node. Structure qitem having treenode, nextPtrvariables which represents the queue and stores the Treenodetype value.

voidinsertnode(node **ptr, int value) function inserts the node in the tree and create a tree.

voidinorder(node ptr) function displays the tree values in sorting order.

voidpreorder (node ptr) function displays the tree values in pre order fashion.

voidpostorder(node ptr) function displays the tree values in post order.

voidlevelorder(node ptr) function display the tree values in sorting order.

voidenque(queue front, queue taiil, node tnode) function stores the Treenodetype data in a queue.

nodedeque(queue front, queue tail) function delete the Treenode type from the queue and return the Treenode type value.

Program description:

The main purpose of the program is to create binary search tree and display the tree value using levelorder algorithm. It then compares the output of this algorithm with the preoder, inorder and postorder output.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Given the following infix expression: (28 * (33 - 3) + 10) / (4 * 0.5) % 4 Give the equivalent postfix expression Draw the tree corresponding to the recursive calls to evaluate the postfix expression. What is the depth of your tree?

C++, Write a recursion function that counts the positive elements multiple of 5 in a binary search tree and counts the elements less than 0 and multiple of 2, then returns the two counts multiplied to the main.Note that you have to write only one function and you can add parameters to the function as needed

1. Do some research about binary search trees. 2. Create a structure in C for the nodes of this tree. Which variables do the structure have? 3. Write a function that builds a balanced binary search tree. The input argument of this function is a sorted array of integers. 4. Write a recursive function that inserts a new element to the tree. The input argument of this function is a pointer to the head node of the tree. 5. What is the time complexity of this insertion function?