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 structure property in a heap?
What is non linear data structure with example?
Explain the Complete structure of hashmap along with the basic coding of the hashmap internal implementation.
What is a 2 dimensional array?
Is set sorted?
Can you sort a string?
What are the advantages of linked list over an array?
How do you search for a target key in a linked list?
What are the main differences between the linked list and linear array?
Can I provide array size dynamically?
What is the difference between hashset and hashmap?
What is a linear search?