Consider the following binary search tree diagram: Which of the following trees represents the correct result after inserting element T?
A) I
B) II
C) III
D) IV

Question

Consider the following binary search tree diagram:  Which of the following trees represents the correct result after inserting element T? 
A) I 
B) II 
C) III 
D) IV

Quizplus · Accepted Answer

In a binary search tree, all elements on the left of a node should be smaller than the node, and all elements on the right should be greater than the node. After inserting T, the correct result should have T as a leaf node on the left of node P. Only option B satisfies this condition. A is incorrect because T is on the right of node P, while C and D both have T as the right child of node O, violating the binary search tree property.

Consider the Following Binary Search Tree Diagram: Which of the Following