Interested to Buy Any Domain ? << Click Here >> for more details...
In which data structure, elements can be added or removed at
either end, but not in the middle?
- 42 Answers
- 105758 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answer Posted / vaishali naidu
Double ended queue is the right answer but stack and queue
are also right answers as they allow LIFO and FIFO
principles not deletion or inserting from middle. IF its a
priority queue then we can insert the elements in between.
| Is This Answer Correct ? | 7 Yes | 3 No |
Post New Answer View All Answers
What are the advantages and disadvantages of linked list over array?
What are the tasks performed while traversing a binary tree?
How would you use bsearch() function to search a name stored in array of pointers to string?
Is list a data structure?
What is array sort?
Evaluate the following prefix expression " ++ 26 + - 1324" (Similar types can be asked)
Define a linear data structure.
What is the complexity of arrays sort?
How will you represent a linked list in a graphical view?
How to sequentially represent max-heap?
Does stringutils isempty check for null?
Define dynamic data structures?
What do you mean by 2-3 tree?
What is a static structure?
What does stack top do?
