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
- 106129 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 |
Which sort is best for linked list?
List the data structures which are used in rdbms.
Is hashmap synchronized?
Where is insertion sort used?
How does the bubble sort work?
Write a program to sum values of given array.
If we add enum constants to a sorted collection ( treemap , treeset ), what will be the order in which they will be maintained?
Why is quicksort faster than merge sort?
When is a binary search algorithm best applied?
What is arraylist load factor?
What are vectors used for in real life?
What is map data structure?
Windows 
