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
- 106039 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 is linked list with example?
Why do we use insertion sort?
How can you add an item to the beginning of the list?
What is the structure of an array?
What is a treeset?
Define a queue?
Define hash table?
What is arrays copyof?
What is the difference between data types and data structures?
What is a pass in bubble sort?
What is the need for extendible hashing?
What is binary tree and its properties?
Describe full binary tree and complete binary tree.
How can we reverse a singly linked list?
Which is the simplest file structure?
