Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / baskar
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.
Input restricted deque means we can delete at both end
but insert only at end of the queue(ie) rear .
Output restricted deque means we can insert at both end
but delete only at end of the queue(ie)front.
| Is This Answer Correct ? | 30 Yes | 2 No |
Post New Answer View All Answers
Explain the terms base case, recursive case, binding time, run-time stack and tail recursion.
Does arraylist have index?
Which sorting algorithm has minimum number of swaps?
What stack means?
Which sorting algorithm uses minimum number of swaps?
What is sorting explain?
Why do we Use a Multidimensional Array?
Name few collections map implementations?
What are the advantages of merge sort?
Why do we use different types of data structures?
What does arraylist remove return?
Who invented merge sort?
What is data structure in programming language?
Does list maintain insertion order?
In what order the elements of a hashset are retrieved?
