tree data-structure

Question

Which of the following data structures will be the most efficient for inserting a number into a sorted list of numbers?

• A. Queue
• B. Stack
• C. Linked list
• D. Array

Answer 1

queue  & stack are of no use in sorted list as they have only one policy fifo and lifo.    linked list will take more time than array in inserting(as in sorted order we can apply binary search in array ) so ans is D array

Comments

yeah, i think array is the answer but they give answer as linked list.

---

https://gateoverflow.in/46266/algo

---

thanks  shifting is bigger  problem in array in comparison to searching position   problem in linked list

---

But shifting is problem when deletion.but the question is about insertion. I think in insertion increasing in size at run time is the problem for large no. of element

---

how u can insert an element  without shifting in an array it can be any position middle, beg  etc

---

But we can do by set it up a variable.and each time on insertion we can increase this variable by pointing out the current location.

---

read question carefully there is an sorted array and the new element's location can be at any place say if it is at begining then u must shift all existing elements   to right

Answer 2

Ans : Array.

If the answer is linked ist, then option should be doubly linked list.