Question: Match the following: Insert Delete 1) A) O(n) O(n) 2) Array ) (1) O(1) 3) Linked List C) O(log n) O(log n) (Assume Insertion
Match the following: Insert Delete 1) A) O(n) O(n) 2) Array ) (1) O(1) 3) Linked List C) O(log n) O(log n) (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- 3- 4-D c) 1-D 2-C 3-A 4-B d) 1-A 2-D 3-B 4-C
Step by Step Solution
3.45 Rating (158 Votes )
There are 3 Steps involved in it
Heap insertion complexity OLogn Heap deletion complexity ... View full answer
Get step-by-step solutions from verified subject matter experts
