What is the BST rule for the left subtree?
Practice this question from Quiz: Trees, Stacks, and Queues, with options and an explanation.
Question
What is the BST rule for the left subtree?
Option A — Correct answer
Keys are less than the current node key
BST ordering places smaller keys on the left and larger keys on the right.
Option B
Keys are always greater
Option C
Keys are always equal
Option D
Keys are stored randomly