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 |
Write a Binary Search program
What are data structures in programming?
How to reverse a linked list iterative algorithm?
How do you declare An array of three char pointers
Which interfaces are implemented by hashmap?
how to find the number of possible tree in the given tree.
12 Answers Persistent, TCS, Wipro,
What is array define its types?
Explain how is linked list implemented?
What is array and its types?
What is the difference between push and pop?
What is int data type?
What are three common types of traversals?