In which data structure, elements can be added or removed at
either end, but not in the middle?
- 42 Answers
- 94617 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / chandrashaker
the answers above said(linked lists,stacks,queues)are not correct answers.the correct answer is "dqueus" also called it as double ended queue in which we can insert all the elements from front and rear
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / arockia dass
Enque and Deque is used to insert or remove an element at
the start or end of the queue
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / saran
deque is the correct one because the elments can be added or removed in both direction ie front and rear.......
but not in the middle
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / sarmistha saha
double ended queue.
and i am sure about this
| Is This Answer Correct ? | 0 Yes | 0 No |
Is binary tree balanced?
Why do we use data structures?
What is inserting in data structure?
What is height balanced tree?
In rdbms, explain what is the efficient data structure used in the internal storage representation?
Can we make hashmap synchronized?
What is push and pop in stack?
Why sorting algorithms are important?
What is the default size of an arraylist?
What is an example of an array?
How to pass in data structure exam?
What is a dequeue?
Windows 
