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.
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
Related Questions on Trees in Data Structures
A. Inorder
B. Preorder
C. Postorder
D. Level-order

Join The Discussion