Answer Posted / venu
in dqueue there are 2 types.
1.)input restricted queue:-Means insert at rear and delete
at both sides(front and rear).
2.)output restricted queue:-Means insert at both the
ends(front and rear)and delete at one end that to front.
| Is This Answer Correct ? | 6 Yes | 4 No |
Post New Answer View All Answers
Can a binary tree be empty?
Why hashtable is faster than arraylist?
Tell me do array subscripts always start with zero?
Differentiate between iterator and enumeration.
How can a binary tree be represented using the rotation?
Explain recursive function & what is the data structures used to perform recursion?
Define the term “percolate up”?
If you do not initialize an array what will happen?
Explain the most efficient method to reverse a linked list?
Does arraylist maintain insertion order?
Is treemap synchronized?
What are the disadvantages array implementations of linked list?
What is peek in stack?
Which is the parent class of linkedhashset class?
Given M x N matrix with sorted elements row wise and column wise, find elements?
