Q88
Why Red-black trees are preferred over hash tables though hash tables have constant time complexity?
A.
no they are not preferred
B.
because of resizing issues of hash table and better ordering in redblack trees
AnswerC.
because they can be implemented using trees
D.
because they are balanced
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board