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 is a priority queue?

0 Answers  


What do you mean by priority queue?

0 Answers  


Which collection type is used to maintain uniqueness of data structure?

0 Answers  


How is it possible to insert different type of elements in stack?

7 Answers   TCS,


State the demerit of linear representation of binary trees?

0 Answers  






How can you represent a linked list node?

0 Answers  


Why quicksort is called quick?

0 Answers  


Name some applications which use linked lists.

0 Answers  


What does arraylist remove do?

0 Answers  


What do u mean by array?

0 Answers  


What is default array size?

0 Answers  


What are the issues that hamper the efficiency in sorting a file?

0 Answers  


Categories