pankaj.leon

//Complete Binary Tree... //Leaf nodes as left as possible and ... //All levels except last must be full... //Queue is used for insertion in Tree... //Queue implemented as Circular Queue... #include<iostream.h> class node; class queue { node** q; int max; int front,rear; public: queue() { front=-1; rear=-1; max=10; q=new (node*)[10]; …

> WE'll be taking inorder traversal of the tree and during the traversal will modify the right pointers only(using method "make_right") such that a linked list is formed having only valid right pointers. Then another method "make_left" is called to make the left pointers of the nodes point to valid …