Question: What data structure is appropriate if you need insertion, deletion and look up be performed in O ( 1 ) time ( on average )

What data structure is appropriate if you need insertion, deletion and look up be performed in O(1) time (on average)? A. Static sorted array B. Dynamic unsorted array C. Dynamic sorted array D. Linked list E. Hash set

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!