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
- 106994 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
Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?
How can I learn data structures?
Can we add heterogeneous elements into treemap?
What are the different types of collections?
Calculate the efficiency of sequential search?
What is the time complexity of hashmap get () and put () method?
What is the difference between set and unordered_set?
What is collections singletonmap?
Can an arraylist be null?
What is the complexity of selection sort?
What is entryset method in map?
What is the difference between classifying and sorting?
Why is concurrenthashmap thread safe?
How do you sort an arraylist in descending order?
What is impact of signed numbers on the memory?
