📚 dsaflash.cards
Problems
Log in
Sign up
Home
/
Advanced Data Structures
/
Balanced Trees
Balanced Trees
Question 1 of 6
Why does inserting keys 1, 2, 3, 4, 5 into an unbalanced BST degrade search to O(n)?
A
The tree exceeds its maximum allowed height
B
Each key is larger than the previous, so every insert goes right, forming a linked list
C
Keys must be inserted in random order to maintain O(log n) search
D
The BST invariant is violated after three consecutive inserts
← Back to categories