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
What is peek in stack?
How many types of data structures are there?
When ArrayIndexOutOfBoundsException occurs?
Explain quick sort?
Explain about set and their types in a collection?
Define splay tree?
Why is null not allowed in concurrenthashmap?
What is unhashable type list?
Define a linear data structure.
Does treemap allow duplicate keys?
What do you mean by disjoint set adt?
Define indegree of a graph?
What is binary tree? Explain its uses.
List the data structures which are used in rdbms.
Explain different methods in which you can traverse a tree?
