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
- 105736 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answer Posted / sumit
dequeue is the correct answer.unlike queues elements can be
added at both ends rather than one end ,but not in the middle..
| Is This Answer Correct ? | 22 Yes | 4 No |
Post New Answer View All Answers
What is the complexity of arraylist?
What are the different types of sorting? Explain the difference between them.
Explain extended binary tree.
Define linked lists?
What is a cycle or a circuit?
Is it legal to initialize list like this?
Define balance factor of a node in avl tree?
What are different methods of collision resolution in hashing.
What is advantage and disadvantage of linked list?
What will be the output of below code?
What are the Advantages and disadvantages of Array?
Which interfaces are implemented by linkedlist?
Explain different methods in which you can traverse a tree?
Can treeset contain duplicates?
How will you explain circular linked list?
