Vidyalelo
Data Structure · Q45

Trees in Data Structures

Programming · Data Structure · question 45

Q45

Which property is maintained in a Red-Black Tree to ensure balanced height?

A.
Each path from a node to its descendant leaves has the same number of black nodes.
Answer
B.
The tree is always a complete binary tree.
C.
The root node is always black.
D.
All nodes have at most two children.

Answer: Option A

Solution

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