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
- 105967 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answer Posted / loveleen kaur
a deque is a linear list in which elements can be added or
removed at either end but not in the middle..it is the
contraction of name double ended queue..
| Is This Answer Correct ? | 3 Yes | 1 No |
Post New Answer View All Answers
What is adt in data structure with example?
Explain linear linked implementation of Stack and Queue?
What is pivot in quicksort?
Which is the simplest file structure? (a) Sequential (b) Indexed (c) Random (a) Sequential
Define separate chaining?
What are the types of algorithms?
What do you mean by general trees?
Which is better hashset or treeset?
Is quicksort a stable algorithm?
Describe linear probing with an example.
What is bubble sort with example?
Differentiate between singly and doubly linked lists?
How many sorting are there in data structure?
What is merge sort and how it works?
Which is better merge or quick sort?
