Chapter 19, Problem 1PC

Program Plan Intro

Simple Binary Search Tree Class

Program Plan:

• Include the required header files.
• Define the class BTreeNode.
  • Create constructor by passing the three parameters.
  • Declare the object for binary tree.
  • Declare class BST has friend.
• Define the class BST.
  • Define the search() function.
    • Call search() function recursively and then return the result.
  • Declare insert() function prototype.
  • Define inorder() function.
    • Call inorder() function recursively and then return the result.
  • Declare the private search() function prototype.
  • Declare the private inorder() function prototype.
• In the search() function,
  • Check whether the tree is empty. If yes, return false, there is no node in tree.
  • Check whether the tree is equal to x. If yes, return true, the search value is found
  • Check whether the tree is greater than x. If yes, call search() function by passing left node and result is returned.
  • Otherwise, call search() function by passing right node and result is returned.
• In the insert() function,
  • Check whether the tree is empty. If yes, create an object for binary tree.
  • Loop executes until the tree is not empty. If yes,
    • Check whether x is less than or equal to tree. If yes, x goes to left node of binary tree.
    • Otherwise, x goes to right node of binary tree.
• In the inorder() function,
  • Check whether the tree is empty. If yes, exit the statement.
  • Call inorder() function by passing left node.
  • List the inorder elements from tree.
  • Call inorder() function by passing right node.
• Define the “main()” function.
  • Read the five inputs from user.
  • Call insert() function to insert all elements into binary tree.
  • Call inorder() function to inorder the elements present in binary tree.
  • Call search() function to search the specified values and then displays it.