In which data structure, elements can be added or removed at
either end, but not in the middle?
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 minimum depth of binary tree?
Is red black tree balanced?
Briefly explain recursive algorithm?
Which is faster list or set?
What are the 3 types of measurement?
What are the data structures used in RDBMS, Network data model & Hierarchical data model?
Is it possible to insert different type of elements in a stack? How?
Does hashmap allow null keys?
Can we define the size of arraylist?
How many passes are required in bubble sort?
Difference between abstract data type, data type and data structure?
What is map data structure?