Beginner
Data Structures & Algorithms
Q30 / 100
What is a self-balancing BST?
Correct! Well done.
Incorrect.
The correct answer is B) A BST that automatically maintains balance after insertions and deletions to guarantee O(log n) operations
B
Correct Answer
A BST that automatically maintains balance after insertions and deletions to guarantee O(log n) operations
Explanation
Self-balancing BSTs (AVL, Red-Black, etc.) perform rotations after insertions/deletions to keep height O(log n), avoiding O(n) worst-case degradation.
Progress
30/100