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



In which data structure, elements can be added or removed at either end, but not in the middle?..

Answer / neelaprabha

Double ended queue

Is This Answer Correct ?    143 Yes 6 No

In which data structure, elements can be added or removed at either end, but not in the middle?..

Answer / vivek tiwari

DEQUES Also known as Deck

Is This Answer Correct ?    70 Yes 1 No

In which data structure, elements can be added or removed at either end, but not in the middle?..

Answer / pavan

Deque

Is This Answer Correct ?    43 Yes 1 No

In which data structure, elements can be added or removed at either end, but not in the middle?..

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

In which data structure, elements can be added or removed at either end, but not in the middle?..

Answer / samurai atp

Deck is the correct answer

Is This Answer Correct ?    25 Yes 0 No

In which data structure, elements can be added or removed at either end, but not in the middle?..

Answer / tasneem uddin

Double Ended Queue is the right answer.

Is This Answer Correct ?    25 Yes 0 No

In which data structure, elements can be added or removed at either end, but not in the middle?..

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

In which data structure, elements can be added or removed at either end, but not in the middle?..

Answer / swapna

its the doubly ended queue...

Is This Answer Correct ?    22 Yes 0 No

In which data structure, elements can be added or removed at either end, but not in the middle?..

Answer / naz

Dequeue is the exactly Right answer........am 100% sure for
it.........

Is This Answer Correct ?    22 Yes 0 No

In which data structure, elements can be added or removed at either end, but not in the middle?..

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

Post New Answer

More Data Structures Interview Questions

Which is faster hashset or treeset?

0 Answers  


Why do we need linked list?

0 Answers  


What is binary search tree and explain its time complexity?

0 Answers  


Write is a binary search tree? Write an algorithm and tell complexity?

0 Answers   ITC Indian Tobacco Company,


Can hashmap store null values?

0 Answers  






Which is better arraylist or linkedlist?

0 Answers  


What is stack and queue in data structure?

0 Answers  


What are the disadvantages of using collection classes over arrays?

0 Answers  


Differentiate between queue and stack.

0 Answers  


What is difference between list set and map?

0 Answers  


Is null allowed in list?

0 Answers  


By Which algorithm, the 8 queens problem is solved?

0 Answers  


Categories