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

c) An expression of A + B^3 – C/D is obtained using a rooted tree. i. Draw a rooted tree with the height of 2 to represent the postorder traversal. ii. Justify whether the rooted tree in 3-c(i) is balanced or not. iii. From tree in c(i), get the mathematical expression using the inorder traversal. d) Figure 3 represents a network of paths in a park. The number on each edge represents the length of the path in meters. The cost per meter is RM120. To gain as much profit, the contractor asked one of his staff to find the minimum network needed using Kruskal's algorithm. G 21 16 17 21 F 11 23 E 11 7 15 18 В 11 20 A Figure 3 i. Explain why the staff's work which is highlighted in red is incorrect. ii. Help the staff to find the correct minimum network using Kruskal's algorithm and states its length and total cost. iii. Is there any possibiliy, more than one distint MST obtained for the Figure 3?. If yes, justify your answer and show the network.

Language : C

Course : Data Structure and Algorithms Write a java/c++ code or an algorithm to solve the following problem. After that dry run and show output of algorithm using an example binary tree. . Write a recursive function to write the parent of the all the nodes while traversing. Like if you traverse the root node write the current node a, parent null. Then if you go to left sub tree, your code will show, current node : b , parent a and so on.