Notes on Data Structure

The Applications of the queue is given as follows: Queues are widely used as waiting lists for a single shared resource like a printer, disk, CPU. Queues are used in the asynchronous transfer of data (where data is not being transferred at the same rate between two processes) for eg. pipes, file IO, sockets. Queues … Read more

A queue can be defined as an ordered list which enables insert operations to be performed at one end called REAR and delete operations to be performed at another end called FRONT. A queue is a linear data structure that follows the First In, First Out (FIFO) principle, meaning that the element inserted first will … Read more

#include #include void beg_insert(int); struct node { int data; struct node *next; }; struct node *head; void main () { int choice,item; do { printf(“\nEnter the item which you want to insert?\n”); scanf(“%d”,&item); beg_insert(item); printf(“\nPress 0 to insert more ?\n”); scanf(“%d”,&choice); }while(choice == 0); } void beg_insert(int item) { struct node *ptr = (struct node … Read more

The doubly linked list is a complex type of linked list in which a node contains a pointer to the previous as well as the next node in the sequence. In a doubly linked list, a node consists of three parts: node data pointer to the next node in sequence (next pointer) pointer to the … Read more

The heterogeneous linked list contains different data types, so it is not possible to use ordinary pointers for this. For this purpose, you have to use a generic pointer type like void pointer because the void pointer is capable of storing a pointer to any type. In a heterogeneous linked list, where each node can … Read more