Intermediate
Data Structures & Algorithms
Q42 / 100
What distinguishes an AVL tree from a standard BST?
Correct! Well done.
Incorrect.
The correct answer is B) AVL trees maintain a balance factor of at most 1 at every node, performing rotations to restore balance after mutations
B
Correct Answer
AVL trees maintain a balance factor of at most 1 at every node, performing rotations to restore balance after mutations
Explanation
AVL trees track the balance factor (height difference of left and right subtrees) and perform single or double rotations to keep it within {-1, 0, 1}, guaranteeing O(log n) operations.
Progress
42/100