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 / vivek tiwari
I think that Linked List is not correct answer. Because
items can be added at middle.....
| Is This Answer Correct ? | 42 Yes | 3 No |
Answer / achintya shankar adhikari
it must b DEQUEUE,where elements can be added or removed at
either end,but not from the middle end..
| Is This Answer Correct ? | 25 Yes | 3 No |
Answer / naz
Dequeue is the exactly Right answer........am 100% sure for
it.........
| Is This Answer Correct ? | 22 Yes | 0 No |
Answer / auradi
Double ended queue is the way in which a elements r inserted
and deleted from either end not been inserted from middle or
removed.....
I am Sure about this answer plz check tenenbam
Datastructure using c and c++ there is an explanation given
for this
| Is This Answer Correct ? | 25 Yes | 3 No |
Why do we use insertion sort?
What is data in computer science?
What is difference between list and array list?
Whether Linked List is linear or Non-linear data structure?
List the area of applications where stack data structure can be used?
Difference between hashset and treeset?
how a polynomial such as 6x^6+4x^3-2x+10 can be represnted by linked list?write an algorithm that reads such an polynomial
Differentiate between hashmap and hashtable.
How do you empty an arraylist?
Why do we use stacks?
What actions are performed when a function returns?
For addition and deletion. Which one is most preferred: array list or linked list?