In which data structure, elements can be added or removed at
either end, but not in the middle?
- 42 Answers
- 94525 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 |
Does treemap allow duplicate keys?
Define a linear and non linear data structure.
Explain Array
Explain the term tail recursion?
What is Another name of Dynamically allocating memory.
Which sorting algorithm is best for small data?
Is a hashmap a dictionary?
In RDBMS, what is the efficient data structure used in the internal storage representation?
What is the difference between one and two dimensional?
What is sequential sorting?
What is mean by selection sort?
What is the default capacity of hashmap?
Windows 
