Vidyalelo
Data Structure · Q14

Trees in Data Structures

Programming · Data Structure · question 14

Q14

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
Answer
D.
Every node has at most two children

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board