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 / amit tyagi

stack,because we can only do push-pull it at two ends nor
in middle.

Is This Answer Correct ?    12 Yes 27 No

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

Answer / sarmistha

linked list

Is This Answer Correct ?    21 Yes 148 No

Post New Answer

More Data Structures Interview Questions

What is the best time complexity of bubble sort?

0 Answers  


What is a static structure?

0 Answers  


What is a singletonlist?

0 Answers  


Write the advantage of separate chaining?

0 Answers  


Where is data structure used?

0 Answers  






How do I push an element into a stack?

0 Answers  


Define degree of the node?

0 Answers  


Is map a collection?

0 Answers  


Does linkedhashset allow null values?

0 Answers  


Why is treeset sorted?

0 Answers  


How do treesets work internally?

0 Answers  


Is linked list faster than array?

0 Answers  


Categories