Chapter 19, Problem 10PC

Program Plan Intro

Prefix Representation of Binary Trees

Program Plan:

“IntBinaryTree.h”:

• Include all the required header files.
• Define the class “TreeNode”.
  • Assign a value to the node, and set the left child of node to leftp and right child of node to rightp.
  • Create function void insert to insert items into nodes of tree.
  • Create a function void destroySubtree that calls the binary tree function and deletes the nodes which are present in the tree.
  • Function to overload the stream insertion and print tree elements void treePrint is called.
  • Functions to display the tree in inorder , pre order and post order void displayInOrder , void displayPreOrder(TreeNode *) and void displayPostOrder are called.
  • Print all the elements of the tree.

“IntBinaryTree.cpp”:

• Include all the required header files.
• Create a tree Function void IntBinaryTree::insert that inserts a number into a given sub tree of the main binary search tree by checking for availability of free nodes in the binary search tree.
• Create a function void IntBinaryTree::destroySubtree calls the binary tree function and deletes the nodes which are present in the tree.
• Create a function bool IntBinaryTree::search where user enters a number to search, the function search searches the number inside the binary search tree and if present returns true, else false otherwise .
• Create a tree function void IntBinaryTree::remove that deletes the node in the given tree that has same value as entered by user by searching the left and right subtrees.
• Display the tree elements in inorder, pre order and post order.
• Display the items present in tree prefix type.

“main.cpp”:

• Include all the required header files.
• Call the Binary tree class to build a tree.
• Enter elements into the tree.
• Delete elements and print the elements of the tree in prefix form.