Answer Posted / priya
Dequeue is another variation of queue where both insertion
and deletion operation can be made at either ends i.e front
and rear of the structure.
| Is This Answer Correct ? | 3 Yes | 1 No |
Post New Answer View All Answers
What is the complexity of adding an element to the heap?
What is the best case time complexity of bubble sort?
What is sequential sorting?
Which sorting is worst?
Mention some drawbacks of the linked list.
What is an ordered list?
What is difference between hashset and treeset?
How do you determine if a binary tree is height balanced?
Tell me about circular linked list?
What is the use of hashtable?
How will you explain circular linked list?
What will you prefer for traversing through a list of elements between singly and doubly linked lists?
List out the advantages of using a linked list?
Explain multiply linked list in short.
What is the relationship between a queue and its underlying array?