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

What do you mean by: Syntax Error, Logical Error, Runtime Error?

7 Answers   College School Exams Tests, Microsoft,


Which is faster hashmap or hashset?

0 Answers  


What is a multidimensional array?

0 Answers  


How many parts are there in a declaration statement?

0 Answers  


Write an algorithm to check if there is a loop in a doubly linked list.

0 Answers   DELL,






What are the non linear data structure?

0 Answers  


Which is the parent class of deque<e> class?

0 Answers  


What is Storage Structures and File Structures? Can you show their relation? What are the examples of each? Thanks

0 Answers  


How do arrays work?

0 Answers  


What is difference between hashmap and hashtable?

0 Answers  


What is a map in programming?

0 Answers  


Why do we need a data structure?

0 Answers  


Categories