In which data structure, elements can be added or removed at
either end, but not in the middle?
Answer Posted / gopesh
IT is stack...because we can push or pop at one end.......it can be done using array where one side is fixed or using linked list where either head is kept constant or null node.....
| Is This Answer Correct ? | 2 Yes | 2 No |
Post New Answer View All Answers
What is weight balanced tree in data structure?
What is difference between list set and map?
What is doubly linked list?
Why sorting algorithms are important?
Can you use Bubble Sort To sort the number of elements.
What is the purpose of thread?
Define leaves?
What is an ordered map?
A lot of data structures related programs related to only trees and graphs, like the diameter of a tree, removing the loops in a graph etc.
How do arrays work?
How do you sort an array by value?
Why do we use data structures?
Define rehashing?
Why do we need linked list?
How do treesets work internally?