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
- 104223 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answer Posted / chandrashaker
the answers above said(linked lists,stacks,queues)are not correct answers.the correct answer is "dqueus" also called it as double ended queue in which we can insert all the elements from front and rear
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What are two types of sorting?
What is range search?
What is a hash in programming?
What is comparator interface used for?
Is an arraylist an object?
How do treesets work internally?
Explain different methods in which you can traverse a tree?
Define disjoint set adt?
Which language is best for data structures?
What is nsmutablearray?
What is huffman’s algorithm?
Name few classes that implement collection interface?
Explain what is B-tree?
Discuss how to implement queue using stack.
How many types of search algorithms are there?
