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