a) no they are not preferred
b) because of resizing issues of hash table and better ordering in redblack trees
c) because they can be implemented using trees
d) because they are balanced
Why Red-black trees are preferred over hash tables though hash tables have constant time complexity?
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Why Red-black trees are preferred over hash tables though hash tables have constant time complexity?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!