Interested to Buy Any Domain ? << Click Here >> for more details...
In which data structure, elements can be added or removed at
either end, but not in the middle?
- 42 Answers
- 105751 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
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
Write a program for reversing the Single Linked List?
What is insertion sort technique?
If we add enum constants to a sorted collection ( treemap , treeset ), what will be the order in which they will be maintained?
What is difference between hashmap and linkedhashmap?
Explain what do you mean by insertion sort, bubble sort and selection sort? Also, explain the differences among the functionalities of the three sorts.
Is tuple immutable?
Which interfaces are implemented by hashmap?
List some applications of multilinked structures?
What is the limit of arraylist?
Why do we need a data structure?
What is garbage collection in data structure?
Explain the common uses of threaded binary tree.
Define double hashing?
In what areas do data structures applied?
What do you understand by doubly linked list?
