The balance restriction on a red/black tree is somewhat less strict than that for AVL trees. However, in both cases, the find operation is order ______.
A) n
B) log n
C) n log n
D) None of the above

Question

Quizplus · Accepted Answer

The find operation in both red/black trees and AVL trees is order log n due to their balanced nature, which ensures that the height of the trees is kept logarithmic relative to the number of nodes.

The Balance Restriction on a Red/black Tree Is Somewhat Less