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
- 106043 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answer Posted / saran
deque is the correct one because the elments can be added or removed in both direction ie front and rear.......
but not in the middle
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What is the meaning of anonymous array? Explain with an example?
Why hashmap is faster than hashtable?
Define an algorithm.
Why is null not allowed in concurrenthashmap?
Does treeset remove duplicates?
Which file contains the definition of member functions?
How do you sort pseudocode?
Does mentioning the array name gives the base address in all the contexts?
What is difference between for loop and foreach?
What is the use of space complexity and time complexity?
Does concurrenthashmap allow null?
What's difference between stack and queue?
Can we insert null in hashset?
What is bubble sort and quick sort?
What is the minimization factor and time complexity of b-tree?
