Practice
Learn
← Quit
0 / 0 correct
Data Structures
Hard
1 of 10
Which property bounds a red-black tree's height to O(log n)?
A
Each node stores its subtree size
B
All nodes are black
C
Leaves are red
D
Every root-to-leaf path has the same number of black nodes, and no red node has a red child