In which data structure, elements can be added or removed at either end, but no

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

Question Posted / guest

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

More Data Structures Interview Questions

What is array in data structure with example?

Why we use linked list?

Which interfaces are implemented by linkedhashset?

Explain the difference between hashset and hashmap?

What is a spanning tree?does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?

Can arraylist store primitives?

How can you implement a stack?

In tree construction which is the suitable efficient data structure?

Can we modify final arraylist?

Is file a data structure?

What is difference between tree and binary tree?

What is hash data type?

For more Data Structures Interview Questions Click Here