Answer Posted / ramesh
d-queue stands for double ended queue.we can add & delete
elements at either side.they are two other variations like
input restricted deque and output restricted deque
| Is This Answer Correct ? | 23 Yes | 0 No |
Post New Answer View All Answers
Why we need cursor implementation of linked lists?
Why you need a data structure?
in tree construction which is the suitable efficient data structure? (Array, linked list, stack, queue)
How does a treemap work?
What things you would care about to improve the performance of application if its identified that its db communication that needs to be improved?
Write a Program for Linked list manipulation.
Is treeset thread safe?
What is array and string?
Design a datastructure to represent the movement of a knight on a chess board
Describe the height term in a tree.
What are the different types of sorting? Explain the difference between them.
How many null values are allowed in hashmap?
What is a treeset?
What data structure does a binary tree degenerate?
What are all the classes and interfaces that are available in the collections?
