In a Binary Search Tree, for any node, all values in the left subtree are:

Question

Accepted Answer

(B) Less than the node. Explanation: BST property: left subtree values < node value < right subtree values.