Why is checking only parent and child not enough for Validate BST?
Practice this question from Validate Binary Search Tree - Range bounds Pattern Practice Quiz, with options and an explanation.
Question
Why is checking only parent and child not enough for Validate BST?
Option A — Correct answer
A deeper node can violate an ancestor bound
Option B
Parent-child checks are always enough
Option C
BSTs cannot have leaves
Option D
Only root matters
Explanation
A deeper node can violate an ancestor bound even if it satisfies its parent.