Comparing the speed of execution of Red-Black trees and AA-trees, which one has the faster search time?
(b) Red-Black tree
(c) Both have an equal search time
(d) It depends
Asked question is from Binary Trees topic in chapter Binary Trees of Data Structures & Algorithms I
I got this question in my homework.