## Queue in c

Queue in c  is a simple c program to implement queue data structure. In this tutorial, we will see the implementation of queue in c. The queue is a linear type of data structure. It is an unordered group of the element in which elements is added at one end (rear end) and removed from …

## Stack

Stack is linear type of Data Structure. Stack works on a FIRST IN LAST OUT  or LAST IN FIRST OUT fashion. Lets see example stack meaning Stack Example Consider an container or CD’S that is we put CD’S on one another and if we want to take CD’S out then we have to remove the CD which is at the …

## Singly Non Circular Linked List

Singly non circular linked list As we learn the basic of linked list in a previous tutorial we got a basic idea of implementing linked list. Singly non circular linked list is a one type of linked list where singly linked list means we are having a node with data and its next node address …

Linked list is a linear type of data structure. It is a set of data which has data along with the address stored in it. Linked list store the data and address in a node. Node:- Node is a combination of data and the next (address of next node). Linked list is a collection of node …

As we learned in a previous tutorial the basic of doubly linked list. The doubly linked list means we create a node with a 3 field which stores data and two address pointer as a previous and next node address. Doubly circular state that our end node will point to start node and start node …

## Doubly Non Circular Linked List

Doubly Non Circular linked list is another type of linked list. The doubly Non Circular linked list is a type of linked list where a node contains 3 field one contains data in node and two pointers which stores the address of previous and next node as shown below. As we seeing the non circular …