Technical Interview Questions and Answers :: Data Structure
1 / 72
There are two types of datastructure.
1).Linear data structure
2).Non Linear datastucture.
For example linear datastructure are stack queue and link list
Non linear datastructure are tree
2 / 72
Array is an indexed based sequential datasture which is stored contigous memory locations . It is mainly used when the operation is searching of element from the list.
Link list is a sequential datastructure which consists of nodes located at non contigous memory locations. It is used when the operation is insertion and deletion.
3 / 72
Stack is a sequential datastructure which will follow last in first out (LIFO) rules. The mainly operations of stack are : push pop peer empty and full.
Qeque is also a sequential datastructure which will work on First In First Out(FIFI) . It is the datastructure with restriction that the insertion will be performed from one end and deletion from the another end with help of front and rear. The mainly operations will be performed are : enque and deque operations .
We can implement both by using an array (i.e. static implementation ) and another is using linklist that is dynamic implementation.
4 / 72
In circular linked list , every node links to next node in the list except the last node that links to first node of the list. It is similar to single linked list except that last node is connected to the first node.
5 / 72
No Discussion on this question yet!
6 / 72
Priority Queue is an extension of
7 / 72
Struct Node{
Int data; //datafield
Struct Node* next;//address field of the next node
Struct Node*prev;//address field of the previous field
}Struct Node node;
8 / 72
No Discussion on this question yet!
9 / 72
No Discussion on this question yet!
10 / 72
No Discussion on this question yet!