Chapter 12, Problem 12.23E

Program Plan Intro

Program plan:

1. 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.
2. voidinsertnode(node **ptr, int value) function inserts the node in the tree and create a tree.
3. voidinorder(node *ptr) function displays the tree values in sorting order.
4. voidpreorder (node *ptr) function displays the tree values in pre order fashion.
5. voidpostorder(node *ptr) function displays the tree values in post order.
6. voidlevelorder(node *ptr) function display the tree values in sorting order.
7. voidenque(queue **front, queue **taiil, node *tnode) function stores the Treenodetype data in a queue.
8. node*deque(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.