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
B. It ensures nodes are always red
C. It ensures the tree is full
D. It ensures the tree is complete
Answer: Option A
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