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
- 106992 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 is the biggest advantage of linked lists?
How do arrays work?
Can arraylist have duplicates?
What is the complexity of arraylist?
What are some of the best practices relating to the java collection framework?
What is the need of sorting?
What is data structure and its classification?
Is arraylist faster than array?
What is lifo?
How will you sort the elements of array in descending order?
What is the default size of arraylist?
How to do the intersection of two sorted arrays?
What is ascending and descending order?
Calculate the efficiency of sequential search?
What are the properties of binary tree?
