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
- 104279 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 |
What is the complexity of arrays sort?
What is the procedure to insert into a sorted array?
Explain what are the major data structures used in the network data model?
What is collection sort?
What is b tree in data structure?
Discuss how to implement queue using stack.
Which is faster hashmap or hashtable?
Can arraylist have null values?
On clicking a node in a tree, all the adjacent edges are turned on. Calculate min of clicks such that all the edges are turned on.
What are sorting algorithms used for?
Can hashset contain duplicates?
How do I rearrange rows in numbers?
Windows 
