📚 dsaflash.cards
Problems
Log in
Sign up
Home
/
Data Structures
/
Binary Search Trees
Binary Search Trees
Question 1 of 6
The BST invariant requires left < node < right. Is this a local or global property?
A
Local for insert, global for search
B
Global -- every node in the left subtree must be less than the root, and every node in the right subtree must be greater
C
It depends on whether the tree is balanced
D
Local -- only immediate children must satisfy it
← Back to categories