Apr 18, 2026
In a binary search tree, is the left child of a node always less than the node's value?
Correct
Answer given
yes
Answer
Yes. This is the fundamental BST property: all values in the left subtree are smaller than the parent node.
Ash's grade
Correct, the BST property guarantees all left subtree values are less than the parent node.