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
- 105869 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 rule regarding overriding equals and hascode method?
Why linked lists are better than arrays?
What do you mean by probing?
What is static array?
What is the difference between 1d and 2d array?
What is sorting explain?
What is a data structure? What are the types of data structures? Briefly explain them
What is the minimum number of nodes that a binary tree can have?
What is meant by binary tree traversal?
What is dequeue operation?
Does arraylist have a tostring?
Explain implementation of deletion from a binary tree.
Traverse the given tree using Inorder, Preorder and Postorder traversals. Inorder : D H B E A F C I G J Preorder: A B D H E C F G I J Postorder: H D E B F I J G C A
How is the front of the queue calculated ?
Is hashmap get thread safe?
