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
List the data structures which are used in network data modal.
What is the difference between array sort () and array sort t >()?
Mention the advantages of representing stacks using linked lists than arrays?
What are the differences between b tree and b+ tree?
What are the complexity of binary search?
Define a tree?
What do you mean by an Array?
What is array in data structure with example?
What is placement new in data structures?
By Which algorithm, the 8 queens problem is solved?
Is priority queue sorted?
What is complexity of quicksort?
Different Types of pattern?
Is radix sort faster than quicksort?
What is ds heap sort?