Practice
Learn
← Quit
0 / 0 correct
Data Structures
Hard
1 of 40
What keeps an AVL tree balanced?
A
Random priorities
B
Every node is red or black
C
All leaves are at the same depth
D
The heights of each node's two subtrees differ by at most 1, restored with rotations after inserts/deletes