Question

Question 2.
Choose the data structure whose search efficiency is 0(1):
Answer:
O Hash table
O Binary search tree
O Heap
linked list​

Answer 1

Answer:

Hash table is the answer.

Explanation:

Please Mark me as the brainliest. Dosen't  hurt too.

Answer 2

The data structure is Hash table

• It is a data structure that carries out the integrative array abstract data type, thereby allowing the keys to be mapped to the specific values.
• The table should, in theory, be 0(1). The issue arises when two keys are not equal yet produce the same hash.
• As a result, it's critical to choose a key with a decent hash function that's both quick and doesn't frequently result in duplicate values for various objects when utilizing a hash table.