**1.
****Stack:**

**Stack :**

**It is show the working process of the stack and follow the last in first out method. In this data structure we can insert the element and delete the element. It has two method (Push, Pop).**

**Infix to Postfix Conversion :**

**In this module the conversion of the Infix notation to the Postfix notation. It is the application of the stack data structure and perform the postfix conversion using stack.**

**2. ****Queue:**

**Linear Queue :**It is show the working process of the linear Queue and follow the first in first out method. In this data structure we can insert the element and the delete the element. It has two method ( Insert, Delete).

**Circular Queue :**It is show the working process of the Circular Queue and follow the first in first out method. In this data structure we can insert the element and the delete the element. In this the working pattern is the circular. So, it has the biggest advantage over the Linear Queue that is if any node is remain blank then we can insert the element and occupy the free space. So, we can say that Circular Queue is better then the Linear Queue. It has two method ( Insert, Delete).

**Priority Queue :**It is show the working process of the Priority Queue and follow the insertion an deletion operation based on the priority but if there are two elements has the same priority then follow first in first out method. In this data structure we can insert the element and the delete the element based on their priority. The working pattern of the Priority Queue is totally based on the priority. we have to insert the priority along with the element. It has two method (Insert, Delete).

**3.
****Linked List:**

**Linear Linked List :**

**In this data structure we can insert the element at the bagging of the list, end of the list, or In between of the list and we can also delete the element from the list. In this data structure one node contains the address of the other node into the link part and contains the data into the data part. In this data structure the last node contains the NULL into the address part.**

**Circular Linked List :**In this data structure we can insert the element at the bagging of the list, end of the list, or In between of the list and we can also delete the element from the list. In this data structure one node contains the address of the other node into the link part and contains the data into the data part. In this data structure the last node contains the address of the first node in circular fashion.

**Doubly Linked List :**

**In this data structure we can insert the element at the bagging of the list, end of the list, or In between of the list and we can also delete the element from the list. In this data structure one node contains the address of the other node into the link part and contains the data into the data part and also contains the previous part which contains the address of the previous node of the list. It has the advantage over the linear list that is we can traverse the list in both direction forward and backward. In it last node contains NULL into the link part.**

**Circular Doubly Linked List :**

**In this data structure we can insert the element at the bagging of the list, end of the list, or In between of the list and we can also delete the element from the list. In this data structure one node contains the address of the other node into the link part and contains the data into the data part and also contains the previous part which contains the address of the previous node of the list. It has the advantage over the linear list that is we can traverse the list in both direction forward and backward. In it last node contains the address of the first node into the link part.**

Sign up here with your email