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.