In a binary search tree, which subtree of a node contains elements that are greater than the node’s value?
Show answerHide answer
Correct answer: (B) Right subtree
Explanation
In a BST, keys smaller than a node go in its left subtree and larger keys in its right subtree.