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
- 104722 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 |
sir plz. send me a bunch of questions related to this topic which may help me in campus selection
Which one is faster? A binary search of an orderd set of elements in an array or a sequential search of the elements.
What are the basic operations of stack?
Explain the Linked List
Which is the parent class of printerstatereasons class?
Which is the parent class of linkedhashset class?
What is max heapify?
Explain set interface?
What is dequeue in data structure?
What is a hashers run?
Is bubble sort faster than selection sort?
How do I push an element into a stack?
Windows 
