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
Write any two principles of gradation of structures.
Can list contain null values?
What do you mean by rehashing?
Why is quicksort not stable?
What is non linear structure?
Define path in a graph?
What is the difference between binary tree and binary search tree?
What is a b+ tree? Explain its uses.
What is quick sort example?
What is difference between array and string?
What is weight balanced tree in data structure?
How do you declare An array of three char pointers
Is an arraylist a vector?
What do you mean by heap order property?
What is the difference between data types and data structures?
