Which data structure has the fastest insertion procedure?
A) Binary search tree
B) Ordered array
D) Unordered linked list
E) Ordered linked list
the answer should be either D or E…. I mean, no matter whether the linked list is ordered or un-ordered.. the insertion is going to take same time in both cases.. BST and Heap can not be the answer and, for Ordered array, insertion will be easiest among all, but then shifting of elements will take time.. So, Linked list (D or E)..