In a Red-Black tree, which property ensures that the tree remains balanced?
A. Every node is either red or black
B. The root is always black
C. Every path from a node to its descendant leaves has the same number of black nodes
D. Every node has at most two children
Answer: Option C
This Question Belongs to Data Structure >> Trees In Data Structures
Related Questions on Trees in Data Structures
A. Inorder
B. Preorder
C. Postorder
D. Level-order
Join The Discussion