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

Write a Binary Search program

7 Answers   Microsoft, TCS,


What are data structures in programming?

0 Answers  


How to reverse a linked list iterative algorithm?

0 Answers  


How do you declare An array of three char pointers

0 Answers  


Which interfaces are implemented by hashmap?

0 Answers  






how to find the number of possible tree in the given tree.

12 Answers   Persistent, TCS, Wipro,


What is array define its types?

0 Answers  


Explain how is linked list implemented?

0 Answers   BPL,


What is array and its types?

0 Answers  


What is the difference between push and pop?

0 Answers  


What is int data type?

0 Answers  


What are three common types of traversals?

0 Answers  


Categories