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 quick sort example?
Explain what is binary search?
How do you find the depth of a binary tree?
Can binary tree have 1 child?
What is data algorithm?
What is the impact of signed numbers on the memory?
How efficient is bubble sort?
What is the difference between a stack and an array?
What is the best case for bubble sort?
Define adjacent nodes?
How many different trees are possible with 10 nodes ?
Difference between abstract data type, data type and data structure?