In which data structure, elements can be added or removed at
either end, but not in the middle?
- 42 Answers
- 94818 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 a dequeue?
Which sorting is best?
Which sorting algorithm is the slowest?
What are the types of algorithms?
How will you represent a linked list in a graphical view?
Is merge sort better than quick?
How can we reverse a singly linked list?
Define in brief an array.
Where is data structure used?
Can nsarray contain nil?
Explain what do you mean by insertion sort, bubble sort and selection sort? Also, explain the differences among the functionalities of the three sorts.
Explain stacks and queues in detail.
State the properties of b tree.
What are linked lists good for?
What is meant by binary tree traversal?
