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 |
Which is faster hashset or treeset?
Why do we need linked list?
What is binary search tree and explain its time complexity?
Write is a binary search tree? Write an algorithm and tell complexity?
0 Answers ITC Indian Tobacco Company,
Can hashmap store null values?
Which is better arraylist or linkedlist?
What is stack and queue in data structure?
What are the disadvantages of using collection classes over arrays?
Differentiate between queue and stack.
What is difference between list set and map?
Is null allowed in list?
By Which algorithm, the 8 queens problem is solved?