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 |
Is collection a class or interface?
Explain the common uses of threaded binary tree.
What is an acyclic graph?
Why do we use dynamic arrays?
Is linkedlist thread safe?
What is the time complexity of arraylist and linked list?
Can you please explain the difference between array_name and &array_name?
What is bubble sort with example?
What is a stable algorithm?
write an algorithm to show the procedure of insertion into a b-tree?
What is entryset method in map?
What data type is enum?