Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / avanesh singh
D-queue is a special type of data structure in which insertions and deletions will be done either at the front end or at the rear end of the queue.
The operations that can be performed on deques are-:
· Insert an item from front end.
· Insert an item from rear end.
· Delete an item from front end.
· Delete an item from rear end.
· Display the contents of queue.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Can hashset contain duplicates?
Define red-black trees.
Is arraylist fail fast?
Can we change the size of an array at run time?
When is a binary search best applied?
Is set sorted?
What is heap tree?
what is traversal in linked lists?
What is max heapify?
Is list same as array?
Is quicksort greedy algorithm?
Does linkedhashset allow duplicates?
Why quicksort is faster than merge sort?
Why sorting is done?
Define outdegree of a graph?
