Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / punam & sunita
a deque is a abstract data structure in which insertion and
delection takes place at either side i.e. at rear & front
but not at middle.
| Is This Answer Correct ? | 37 Yes | 2 No |
Post New Answer View All Answers
What are the standard ways in which a graph can be traversed?
What do you mean by sorting?
Why quicksort is faster than merge sort?
What are the different types of hash functions?
Does mentioning the array name gives the base address in all the contexts?
Construct a doubly linked list using a single pointer in each node?
Is json a data structure?
Is bubble sort faster than selection sort?
Write an algorithm through which the inserting and deleting of elements can take place in circular queue?
Which is better selection or bubble sort?
What is static array?
Can we insert null in hashset?
Does treeset remove duplicates?
What is tree in computer science?
What is the complexity of adding an element to the heap?
