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
Define adjacent nodes?
Which is the simplest file structure?
What method is used to place a value onto the top of a stack?
When would you use a hashmap?
State the difference between stacks and linked lists?
What is difference between array and arraylist? When will you use array over arraylist?
How many passes are required in bubble sort?
What are three common types of traversals?
Why is arraylist faster than linkedlist?
What is the complexity of adding an element to the heap?
Does linked list allow null values?
What is the complexity of selection sort?
What is a list of lists?
Can we apply binary search algorithm to a sorted linked list, why?
How many sorting algorithms are there?
