Which data structure is used for efficient searching, insertion, and deletion of elements?
Options
- A. Stack
- B. Queue
- C. Hash Table
- D. More than one of the above
- E. None of the above
C. Hash Table
A Hash Table is a data structure designed for fast searching, insertion, and deletion.
It uses a hash function to convert a key into an index (address) in an array.
This allows operations to be performed in average time complexity O(1).
(A) Stack → Mainly used for LIFO operations, not efficient searching.
(B) Queue → Used for FIFO operations, searching is not efficient.
(C) Hash Table → Provides very fast search, insert, and delete operations.
(D) More than one of the above → Incorrect.
(E) None of the above → Incorrect.
✔ Final Answer: (C) Hash Table
Attempt Quiz Now:
BPSC Tre 4.0 DSA Practice Set