Vidyalelo
Data Structure · Q170

Binary Search Trees(B Tree)

Programming · Data Structure · question 170

Q170

Comparing the speed of execution of Red-Black trees and AA-trees, which one has the faster search time?

A.
AA-tree
Answer
B.
Red-Black tree
C.
Both have an equal search time
D.
It depends

Answer: Option A

Solution

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