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 space complexity of bubble sort?

0 Answers  


What is unbounded queue?

0 Answers  


Why is data structure important?

0 Answers  


How many types of lists are there?

0 Answers  


Is quicksort a stable algorithm?

0 Answers  






What actions are performed when a function returns?

0 Answers  


What is a map in programming?

0 Answers  


How can you insert a node to the beginning of a singly linked list?

0 Answers  


What do you mean by double hashing?

0 Answers  


Can you store different types in an array?

0 Answers  


What are the advantages of modularity?

0 Answers  


What is a vector class?

0 Answers  


Categories