What is the disadvantage of BST over the hash table?

(a) BST is easier to implement

(b) BST can get the keys sorted by just performing inorder traversal

(c) BST can perform range query easily

(d) Time complexity of hash table in inserting, searching and deleting is less than that of BST

I want to ask this question from Hash Tables topic in section Hash Tables of Data Structures & Algorithms I

I have been asked this question during an online exam.

Correct option is (d) Time complexity of hash table in inserting, searching and deleting is less than that of BST

To explain: BST has an advantage that it is easier to implement, can get the keys sorted by just performing in-order traversal and can perform range query easily. Hash table has lesser time complexity for performing insert, delete and search operations.