Which data structure has the fastest insertion procedure?

A) Binary search tree

B) Ordered array

C) Heap

D) Unordered linked list

E) Ordered linked list

@abhijit choudhary in un-ordered it will take O(1) bec u will insert it at d end or beginning of the list, where as in order list 1st ul search the list and insert the new node in ascending or descending order so it take O(n) time ie same as ordered array…… correct ans is D

### Question stats

Question and answer is powered by AnsPress