It can be shown that the upper limit of the height for a Red-Black tree is O(__________).
A) 1
B) log n
C) n
D) n log n

Question

Quizplus · Accepted Answer

The height of a Red-Black tree is limited to O(log n) because the properties of Red-Black trees ensure that the tree remains balanced, with the path from the root to the farthest leaf being no more than twice as long as the path to the nearest leaf. This balancing is achieved through rotations and color changes, which maintain a tree height that allows for efficient search, insertion, and deletion operations, all in logarithmic time complexity relative to the number of nodes in the tree.

It Can Be Shown That the Upper Limit of the Height