Question

Match the following:
Insert
Delete
1) Heap
A) On
O(n)
2) Array
B) O(1)
O(1)
C) O(log n)
O(log n)
3) Linked List
(Assume Insertion at head)
4) Hash Table
D) O(1)
O(n)
a) 1-C 2-A 3-D 4-B
b) 1-B 2-A 3-C 4-D
c) 1-D 2-C 3-A 4-B
d) 1-A 2-D 3-B 4-C​

Answer 1

Answer:

1.c 2.a 3.d 4b is a answers

Answer 2

Answer:

I think option (a) is correct