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
- 104332 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
Is learning data structures necessary?
Is array a data type?
How much time does it take to learn data structures?
Does treemap allow duplicate keys?
What is list and its types?
What is the minimization factor and time complexity of b-tree?
Is copyonwritearraylist thread safe?
Explain Queue
How arraylist increase its size?
Can treemap have duplicate values?
Can you use Bubble Sort To sort the number of elements.
Which interfaces are implemented by printerstatereasons?
Explain heapsort. What is its complexity?
What do you mean by general trees?
What is arrays copyof?
