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
Are hash tables ordered?
How to reference all the elements in a one-dimension array?
What is the difference between array list and vector list?
On clicking a node in a tree, all the adjacent edges are turned on. Calculate min of clicks such that all the edges are turned on.
Traverse the given tree using Inorder, Preorder and Postorder traversals. Inorder : D H B E A F C I G J Preorder: A B D H E C F G I J Postorder: H D E B F I J G C A
What is the prerequisite for binary searching?
What are two types of sorting?
Where will be the free node available while inserting a new node in a linked list?
What is the difference between binary tree and binary search tree?
What is the difference between one and two dimensional?
What are the applications of graph data structure?
Does arraylist guarantee insertion order?
What is the need for extendible hashing?
Define parent node?
What do you mean by level of the tree?
