We have the best collection of Hash Tables Chaining with Binary Trees MCQs and answer with FREE PDF. These Hash Tables Chaining with Binary Trees MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

## Hash Tables Chaining with Binary Trees MCQs

**1. What is the time complexity of insert function in a hash table using a binary tree?**

a) O(1)

b) O(n)

c) O(log n)

d) O(n log n)

**Answer: **O(1)

**2. What is the time complexity of the search function in a hash table using a binary tree?**

a) O(1)

b) O(n)

c) O(log n)

d) O(n log n)

**Answer: **O(1)

**3. What is the time complexity of the delete function in the hash table using a binary tree?**

a) O(1)

b) O(n)

c) O(log n)

d) O(n log n)

**Answer: **O(1)

**4. What is the advantage of a hash table over BST?**

a) hash table has a better average time complexity for performing insert, delete and search operations

b) hash table requires less space

c) range query is easy with hash table

d) easier to implement

**Answer: **hash table has a better average time complexity for performing insert, delete and search operations

**5. 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

**Answer: **Time complexity of hash table in inserting, searching and deleting is less than that of BST

**6. Which of the following technique stores data separately in case of a collision?**

a) Open addressing

b) Double hashing

c) Quadratic probing

d) Chaining using a binary tree

**Answer: **Chaining using a binary tree

**7. Separate chaining is easier to implement as compared to open addressing.**

a) true

b) false

**Answer: **true

**8. Which of the following variant of a hash table has the best cache performance?**

a) hash table using a linked list for separate chaining

b) hash table using binary search tree for separate chaining

c) hash table using open addressing

d) hash table using a doubly linked list for separate chaining

**Answer: **hash table using open addressing

**9. What is the advantage of hashing with chaining?**

a) cache performance is good

b) uses less space

c) less sensitive to hash function

d) has a time complexity of O(n) in the worst case

**Answer: **less sensitive to hash function

**10. What is the disadvantage of hashing with chaining?**

a) not easy to implement

b) takes more space

c) quite sensitive to hash function

d) table gets filled up easily

**Answer: **takes more space