In which data structure, elements can be added or removed at
either end, but not in the middle?
Answer Posted / vaishali naidu
Double ended queue is the right answer but stack and queue
are also right answers as they allow LIFO and FIFO
principles not deletion or inserting from middle. IF its a
priority queue then we can insert the elements in between.
| Is This Answer Correct ? | 7 Yes | 3 No |
Post New Answer View All Answers
Which sorting is used in collections sort?
How expression trees are gets represented in data structure?
Which language is best for learning data structures and algorithms?
What are the advantages of linked list?
What is a queue in data structure?
What things you would care about to improve the performance of application if its identified that its db communication that needs to be improved?
What data type is enum?
Which sorting algorithm is worst?
what is traversal in linked lists?
Define a relation?
Can hashmap have same key?
Why it is important to have aligned addresses? What is the exception generated when there is a misaligned address?
What are the topics in data structures?
What is unmodifiable list?
How do you separate zeros from non-zeros in an array?