Answer Posted / zakiya
d-queme means doubly ended queue.in which insertion and
deletion can be performed any end.
| Is This Answer Correct ? | 24 Yes | 2 No |
Post New Answer View All Answers
Please Help Members By Posting Answers For Below Questions
What is complexity of bubble sort?
What is range search?
What are priority queues?
Is complete binary tree?
What are hashmaps good for?
How do hash tables work?
Is boolean a data type?
What does a bubble chart show?
Which is better than array and linked list?
Explain the term run-time stack?
Which type of memory allocation is referred for linked list?
Which is faster array or linked list?
How can I search for data in a linked list?
What is map data structure?
Can binary tree have 1 child?
