Complete the following algorithm which recursively inserts an item into a binary search tree.
If the root is null
Replace empty tree with a new tree with the item at the root and return true.
Else if the item is equal to root.data
____
Else if the item is less than root.data
Recursively insert the item in the left subtree.
Else
Recursively insert the item in the right subtree.
A) The item is not in the tree; return false.
B) The item is already in the tree; return false.
C) The item is not in the tree; return true.
D) The item is already in the tree; return true.

Question

Quizplus · Accepted Answer

In a binary search tree, each element must be unique. If the item being inserted is equal to the root.data, it means the item is already present in the tree, and the insertion should not proceed to avoid duplicates. Therefore, the correct action is to return false, indicating the insertion did not occur because the item is already in the tree.

Complete the Following Algorithm Which Recursively Inserts an Item into a Binary