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
Can we use ordered set for performing binary search?
What is inserting in data structure?
What is numeric array?
What is hashing technique? Describe in brief.
What is difference between hashmap and hashset?
What are the different types of hash functions?
Which sorting technique is faster?
Where is data structure used?
What is meant by heap sort?
What is the method to find the complexity of an algorithm?
Why is hashmap faster than arraylist?
Define balance factor of a node in avl tree?
State the different types of linked lists?
How do you determine if a binary tree is height balanced?
What is the difference between hashset and hashtable?