Chapter 8, Problem 49E

Program Plan Intro

Binary search tree:

• Binary search tree is a tree; the nodes are sorted in the semantic order.
• Binary search tree nodes can have zero, one, or two children.
• Node without children is called a leaf or end node.
• A node that does not have a superior node is called a root node or starting node.
  • In binary search tree, the left subtree contains the nodes lesser than the root node.
  • The right subtree contains the nodes greater than the root node.
• The binary search will be performed until finding a search node or reaching the end of the tree.

Explanation of Solution

Print the elements of binary search tree:

Step1:

Initially, the algorithm traverses the tree by the order right node, root node, and left node. Here, the root node of the tree is 50.

• It has right node value as 72 in the first level.
• Node 72 has right node 96 in the second level.
• Next, node 96 has right node 107 in the third level.
• Node 107 does not have left and right child, so it print the current node element “107”.
• Then it print the root node element “96”.
• Finally it print the left node element “95”.

As per the algorithm, the “print()” method reaches the node 72. So, it print the current node element “72”.

• Then it print the left node element “51”.

As per the algorithm, next it reaches the node 50. So, it print the current node element “50”.

• Then it print the left node element “26”.

Step 2:

As per the algorithm, the “print()” method reaches the right node 25...