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 |
What do you mean by: Syntax Error, Logical Error, Runtime Error?
7 Answers College School Exams Tests, Microsoft,
Which is faster hashmap or hashset?
What is a multidimensional array?
How many parts are there in a declaration statement?
Write an algorithm to check if there is a loop in a doubly linked list.
What are the non linear data structure?
Which is the parent class of deque<e> class?
What is Storage Structures and File Structures? Can you show their relation? What are the examples of each? Thanks
How do arrays work?
What is difference between hashmap and hashtable?
What is a map in programming?
Why do we need a data structure?