Vidyalelo
Data Structure · Q28

Trees in Data Structures

Programming · Data Structure · question 28

Q28

In a Red-Black Tree, what does the property that "every path from a node to its descendant leaves has the same number of black nodes" ensure?

A.
It ensures the tree remains balanced
Answer
B.
It ensures nodes are always red
C.
It ensures the tree is full
D.
It ensures the tree is complete

Answer: Option A

Solution

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