Which statement is correct regarding binary search tree? I. The value at node N is less than every value in the left subtree of node.
Which statement is correct regarding binary search tree?
I. The value at node N is less than every value in the left subtree of node.
II. The value at node N is greater than or equal to every value in the right subtree of N.
Show answerHide answer
Correct answer: (D) Neither I nor II
Explanation
In a BST, the value at N is greater than every value in its left subtree and less than (or equal to) every value in its right subtree. Both statements reverse this, so neither is correct.