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 is a priority queue?
What do you mean by priority queue?
Which collection type is used to maintain uniqueness of data structure?
How is it possible to insert different type of elements in stack?
State the demerit of linear representation of binary trees?
How can you represent a linked list node?
Why quicksort is called quick?
Name some applications which use linked lists.
What does arraylist remove do?
What do u mean by array?
What is default array size?
What are the issues that hamper the efficiency in sorting a file?