Match the following :
insert delete
1) Heap A)O(n) O(n)
2) Array B)O(1) O(1)
3) linked list
(Assume insertion at head) c)O(log n) O(log n)
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
sachdevaastha14:
ans?
Answers
Answered by
17
Answer:
I question don't understand your question.
Answered by
18
give a photo so that I can understand
Similar questions