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
• C. because they can be implemented using trees
• D. because they are balanced