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 treemap thread safe?
What is stack and queue in data structure?
How do you find the size of an arraylist?
What is the use of sorting the data?
What type of algorithm is binary search?
Write a Binary Search program
What is quick sort example?
What does arraylist remove do?
What stack means?
In what order the elements of a hashset are retrieved?
Where is insertion sort used?
What do you mean by data and data structure?