Chapter 17, Problem 8RE

Explanation of Solution

Inserting elements into a Binary search tree:

The below are the step for inserting the elements into the binary search tree:

• If the node is null then replace it by a new node and insert value into it.
• If the node is not null then compare the new value with the value that is stored by the node.
• If the new value id lesser then insert it to the left node of the current otherwise into the right node and the process is continued for all the nodes.

Inserting: Harry

The root node will be inserted as shown below:

Inserting: Diana

The value of D is less than the H and it needs to be inserted to the left side of the root node.

Inserting: Tom

The value of T is greater than the D and also greater than H it needs to be insert a new node to the right of parent node of the current node.

Inserting: Juliet

The value of J is lesser than the R and it needs to be inserted to the left side of the current node.

Inserting: Romeo

The value of T is lesser than the J and also greater than R node and it needs to be inserted to the right side of parent node of the current node.