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 hashmap or linkedhashmap?
What is hashing with example?
What are examples of data structures?
Define balanced trees?
Does treemap allow null values?
Can you dynamically allocate arrays in expanded memory?
Does hashset maintain order?
What are different types of algorithms?
What is a pseudocode example?
What is the difference between 1d and 2d array?
Will hashmap allow null keys?
How many types of lists are there?