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
What is a hashmap in c?
What is significance of ” * ” ?
How to reverse a linked list iterative algorithm?
Write program for Quick sort ?
What are the scenarios in which an element can be inserted into the circular queue?
Define 2-3-4 tree?
What are the major data structures used in the following areas : network data model & hierarchical data model?
Which sorting algorithm is the slowest?
What is bubble sort?
What is difference between map and hashmap?
What is sorting an array?
Explain what is B-tree?
How is a hashset implemented?
What are the types of array operations?
What are the basic operations of stack?