Data Structures

Data Structure is a way of collecting and organizing data in such a way that we can perform
operations on these data in an effective way. Data Structures is about rendering data elements
in terms of some relationship, for better organization and storage.

Basic types of Data Structures

 Primitive Data Structures.
Integer, Float, Boolean, Char etc,
 Abstract Data Structure are :

 Linked List
 Tree
 Graph
 Stack, Queue etc.
The data structures can also be classified on the basis of the following characteristics:

Characteristic Description

In Linear data structures, the data items are arranged in a linear

Linear
sequence. Example: Array

In Non-Linear data structures, the data items are not in sequence.

Non-Linear
Example: Tree, Graph

In homogeneous data structures, all the elements are of same type.

Homogeneous
Example: Array

In Non-Homogeneous data structure, the elements may or may not

Non-
Homogeneous be of the same type. Example: Structures

Static data structures are those whose sizes and structures

Static
associated memory locations are fixed, at compile time.
Example: Array

Dynamic structures are those which expands or shrinks depending

Dynamic
upon the program need and its execution. Also, their associated
memory locations changes. Example: Linked List created using
pointers
Linked List

The linked list is a linear data structure that contains a sequence of elements such that each
element links to its next element in the sequence. Each element in a linked list is called "Node".
Linked list elements are not stored at a contiguous memory location. The elements are linked
using pointers.

Node:

Each node in a list consists of two parts:

1) data part
2) address part – pointer to the next node

The data part is used to store actual value of the node and address part is used to store the
address of next node in the sequence.

In C, we can represent a node using structures.

struct Node
{
int data;
struct Node * next;
};
// A simple C program to introduce a linked list

#include <stdio.h>
#include <stdlib.h>

struct Node
{
int data;
struct Node * next;
};

void main()
{
// create 3 node pointers of type struct data type

struct Node * first = NULL;

struct Node * second = NULL;
struct Node * third = NULL;

// allocate memory for 3 nodes

first = (struct Node*)malloc(sizeof(struct Node));
second = (struct Node*)malloc(sizeof(struct Node));
third = (struct Node*)malloc(sizeof(struct Node));

first->data = 10; // assign data in first node

first->next = second; // Link first node with the second node
second->data = 20; // assign data to second node
second->next = third; // Link second node with the third node

third->data = 30; // assign data to third node

third->next = NULL;
}

We have the linked list ready.

first second Third

10 2000 20 3000 30 NULL

1000 2000 3000

Single Linked List

Single linked list is a sequence of elements in which every element has link to its next element

in the sequence.

In any single linked list, the individual element is called as "Node". Every "Node" contains two

fields, data field, and the next field. The data field is used to store actual value of the node and

next field is used to store the address of next node in the sequence.

The graphical representation of a node in a single linked list is as follows...

In a single linked list, the address of the first node is always stored in a reference node known as

"head" (Some times it is also known as "front").

Always next part (reference part) of the last node must be NULL.

Example

*head
#include<stdio.h>
#include<conio.h>
#include<alloc.h>

struct node
{
int data;
struct node *next;
};

Struct node *head;

void create()
{
char ch;
do
{
struct node *new_node,*current;

new_node=(struct node *)malloc(sizeof(struct node));

printf("nEnter the data : ");

scanf("%d",&new_node->data);
new_node->next=NULL;

if(head==NULL)
 {
head=new_node;
current=new_node;
}
else
{
current->next=new_node;
current=new_node;
}

printf("nDo you want to creat another : ");

ch=getche();
}while(ch!='n');
}

void display()
{
struct node *temp;
printf("The Linked List : n");
temp =head;
while(temp!=NULL)
{
printf("%d--->", temp ->data);
temp = temp ->next;
}
printf("NULL");
}
void main()
{
create();
display();
}

Operations on Single Linked List

The following operations are performed on a Single Linked List

 Insertion

o Inserting At Beginning of the list

o Inserting At End of the list

o Inserting At Specific location in the list

 Deletion

o Deleting from Beginning of the list

o Deleting from End of the list

o Deleting a Specific Node

 Display or Traversal

Before we implement actual operations, first we need to set up an empty list. First, perform the

following steps before implementing actual operations.

 Step 1 - Include all the header files which are used in the program.
  Step 2 - Declare all the user defined functions.

 Step 3 - Define a Node structure with two members data and next

 Step 4 - Define a Node pointer 'head' and set it to NULL.

 Step 5 - Implement the main method

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>

void insertAtBeginning(int);
void insertAtEnd(int);
void insertBetween(int,int,int);
void removeBeginning();
void removeEnd();
void removeSpecific(int);
void display();

struct Node
{
int data;
struct Node *next;
};

Struct Node *head = NULL;

Insertion
In a single linked list, the insertion operation can be performed in three ways. They are as follows...

1. Inserting At Beginning of the list

2. Inserting At End of the list

3. Inserting At Specific location in the list

Inserting At Beginning of the list

We can use the following steps to insert a new node at beginning of the single linked list...

 Step 1 - Create a newNode with given value.

 Step 2 - Check whether list is Empty (head == NULL)

 Step 3 - If it is Empty then, set newNode→next = NULL and head = newNode.

 Step 4 - If it is Not Empty then, set newNode→next = head and head = newNode.

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>

void insertAtBeginning(int);

struct Node
{
int data;
struct Node *next;
};

Struct Node *head = NULL;

void main()
{
Int value;
printf(“Enter a value to be inserted at the beginning of the list\n”)
scanf(“%d”, &value);
insertAtBeginning(value);
}

void insertAtBeginning (int value)

{
struct Node *newNode;
newNode = (struct Node*)malloc(sizeof(struct Node));
newNode->data = value;
if(head == NULL)
{
newNode->next = NULL;
head = newNode;
}
else
{
newNode->next = head;
head = newNode;
}
printf("\nOne node inserted!!!\n");
}
Inserting At End of the list

We can use the following steps to insert a new node at end of the single linked list...

 Step 1 - Create a newNode with given value and newNode → next as NULL.

 Step 2 - Check whether list is Empty (head == NULL).

 Step 3 - If it is Empty then, set head = newNode.

 Step 4 - If it is Not Empty then, define a node pointer temp and initialize with head.

 Step 5 - Keep moving the temp to its next node until it reaches to the last node in the list

(until temp → next is equal to NULL).

 Step 6 - Set temp → next = newNode.

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>

void insertAtEnd(int);

struct Node
{
int data;
struct Node *next;
};

Struct Node *head = NULL;

void main()
{
Int value;
printf(“Enter a value to be inserted at the end of the list\n”)
scanf(“%d”, &value);
insertAtEnd(value);
}

void insertAtEnd(int value)

{
struct Node *newNode;
newNode = (struct Node*)malloc(sizeof(struct Node));
newNode->data = value;
newNode->next = NULL;
if(head == NULL)
head = newNode;
else
{
struct Node *temp = head;
while(temp->next != NULL)
temp = temp->next;
temp->next = newNode;
}
printf("\nOne node inserted!!!\n");
}
Inserting At Specific location in the list (After a Node)

We can use the following steps to insert a new node after a node in the single linked list...

 Step 1 - Create a newNode with given value.

 Step 2 - Check whether list is Empty (head == NULL)

 Step 3 - If it is Not Empty then, define a node pointer temp and initialize with head.

 Step 4 - Keep moving the temp to its next node until it reaches to the node after which we

want to insert the newNode (until temp → data is equal to location, here location is the

node value after which we want to insert the newNode).

 Step 5 - Every time check whether temp is reached to last node or not. If it is reached to

last node then display 'Given node is not found in the list!!! Insertion not

possible!!!' and terminate the function. Otherwise move the temp to next node.

 Step 6 - Finally, Set 'newNode → next = temp → next' and 'temp → next = newNode'

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
void insertBetween(int, int);

struct Node
{
int data;
struct Node *next;
};
Struct Node *head = NULL;
void main()
{
Int value, loc;
printf(“Enter locations and a value to be inserted\n”)
scanf(“%d%d”, &loc, &value);
insertAtEnd(value, loc);
}

void insertBetween(int value, int loc)

{
struct Node *newNode;
newNode = (struct Node*)malloc(sizeof(struct Node));
newNode->data = value;
if(head == NULL)
{
printf("\List is empty, Insertion is not possible!!!\n");
}
else
{
struct Node *temp = head;
while(temp->data != loc)
temp = temp->next;
newNode->next = temp->next;
temp->next = newNode;
}
printf("\nOne node inserted!!!\n");
}
Deletion

In a single linked list, the deletion operation can be performed in three ways. They are as follows...

1. Deleting from Beginning of the list

2. Deleting from End of the list

3. Deleting a Specific Node

Deleting from Beginning of the list

We can use the following steps to delete a node from beginning of the single linked list...

 Step 1 - Check whether list is Empty (head == NULL)

 Step 2 - If it is Empty then, display 'List is Empty!!! Deletion is not possible' and

terminate the function.

 Step 3 - If it is Not Empty then, define a Node pointer 'temp' and initialize with head.

 Step 4 - Check whether list is having only one node (temp → next == NULL)

 Step 5 - If it is TRUE then set head = NULL

 Step 6 - If it is FALSE then set head = temp → next.

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
void removeBeginning();

struct Node
{
int data;
struct Node *next;
 };
Struct Node *head = NULL;

void main()
{
removeBeginning();
}

void removeBeginning()
{
if(head == NULL)
printf("\n\nList is Empty!!!");
else
{
struct Node *temp = head;
if(head->next == NULL)
{
head = NULL;
}
else
{
head = temp->next;
 printf("\nOne node deleted!!!\n\n");
}
}
}

Deleting from End of the list

We can use the following steps to delete a node from end of the single linked list...

 Step 1 - Check whether list is Empty (head == NULL)

 Step 2 - If it is Empty then, display 'List is Empty!!! Deletion is not possible' and

terminate the function.

 Step 3 - If it is Not Empty then, define two Node pointers 'temp1' and 'temp2' and initialize

'temp1' with head.

 Step 4 - Check whether list has only one Node (temp1 → next == NULL)

 Step 5 - If it is TRUE. Then, set head = NULL. And terminate the function.

(Setting Empty list condition)

 Step 6 - If it is FALSE. Then, set 'temp2 = temp1 ' and move temp1 to its next node.

Repeat the same until it reaches to the last node in the list. (until temp1 → next == NULL)
 Step 7 - Finally, Set temp2 → next = NULL.
 #include<stdio.h>
#include<conio.h>
#include<stdlib.h>
void removeEnd();

struct Node
{
int data;
struct Node *next;
};
Struct Node *head = NULL;

void main()
{
removeEnd();
}
void removeEnd()
{
if(head == NULL)
{
printf("\nList is Empty!!!\n");
}
else
{
struct Node *temp1 = head,*temp2;
if(head->next == NULL)
head = NULL;
else
{
while(temp1->next != NULL)
{
temp2 = temp1;
temp1 = temp1->next;
}
temp2->next = NULL;
}
printf("\nOne node deleted!!!\n\n");
}
}
Deleting a Specific Node from the list

We can use the following steps to delete a specific node from the single linked list...

 Step 1 - Check whether list is Empty (head == NULL)

 Step 2 - If it is Empty then, display 'List is Empty!!! Deletion is not possible' and

terminate the function.

 Step 3 - If it is Not Empty then, define two Node pointers 'temp1' and 'temp2' and initialize

'temp1' with head.

 Step 4 - Keep moving the temp1 until it reaches to the exact node to be deleted or to the

last node. And every time set 'temp2 = temp1' before moving the 'temp1' to its next node.

 Step 5 - If it is reached to the last node then display 'Given node not found in the list!

Deletion not possible!!!'. And terminate the function.

 Step 6 - If it is reached to the exact node which we want to delete, then check whether list

is having only one node or not

 Step 7 - If list has only one node and that is the node to be deleted, then set head = NULL.

 Step 8 - If list contains multiple nodes, then check whether temp1 is the first node in the

list (temp1 == head).

 Step 9 - If temp1 is the first node then move the head to the next node (head = head →
next) and delete temp1.

 Step 10 - If temp1 is not first node then check whether it is last node in the list (temp1 →

next == NULL).

 Step 11 - If temp1 is last node then set temp2 → next = NULL .

 Step 12 - If temp1 is not first node and not last node then set temp2 → next = temp1 →

next .
 #include<stdio.h>
#include<conio.h>
#include<stdlib.h>
void removeSpecific(int);

struct Node
{
int data;
struct Node *next;
};
Struct Node *head = NULL;

void main()
{
Int delValue;
printf(“Enter the value to be deleted\n”)
scanf(“%d”, &delValue);
removeSpecific(delValue);
}
void removeSpecific(int delValue)
{
struct Node *temp1 = head, *temp2;
while(temp1->data != delValue)
{
if(temp1 -> next == NULL)
{
printf("\nGiven node not found in the list!!!");
goto functionEnd;
}
temp2 = temp1;
temp1 = temp1 -> next;
}
temp2 -> next = temp1 -> next;
printf("\nOne node deleted!!!\n\n");
functionEnd:
}

Displaying a Single Linked List

We can use the following steps to display the elements of a single linked list...

 Step 1 - Check whether list is Empty (head == NULL)

 Step 2 - If it is Empty then, display 'List is Empty!!!' and terminate the function.

 Step 3 - If it is Not Empty then, define a Node pointer 'temp' and initialize with head.

 Step 4 - Keep displaying temp → data with an arrow (--->) until temp reaches to the last

node
 Step 5 - Finally display temp → data with arrow pointing to NULL (temp → data --->

NULL).
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
void display();

struct Node
{
int data;
struct Node *next;
};
Struct Node *head = NULL;
 void main()
{
display();
}

void display()
{
if(head == NULL)
{
printf("\nList is Empty\n");
}
else
{
struct Node *temp = head;
printf("\n\nList elements are - \n");
while(temp->next != NULL)
{
printf("%d --->",temp->data);
temp = temp->next;
}
printf("%d --->NULL",temp->data);
}
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>

void insertAtBeginning(int);
void insertAtEnd(int);
void insertBetween(int,int,int);
void display();
void removeBeginning();
void removeEnd();
void removeSpecific(int);

struct Node
{
int data;
struct Node *next;
}*head = NULL;

void main()
{
int choice,value,choice1,loc1,loc2;
clrscr();
while(1){
mainMenu: printf("\n\n****** MENU ******\n1. Insert\n2. Display\n3. Delete\n4. Exit\nEnter your
choice: ");
scanf("%d",&choice);
switch(choice)
{
case 1: printf("Enter the value to be insert: ");
scanf("%d",&value);
while(1){
 printf("Where you want to insert: \n1. At Beginning\n2. At End\n3. Between\nEn
ter your choice: ");
scanf("%d",&choice1);
switch(choice1)
{
case 1: insertAtBeginning(value);
break;
case 2: insertAtEnd(value);
break;
case 3: printf("Enter the two values where you wanto insert: ");
scanf("%d%d",&loc1,&loc2);
insertBetween(value,loc1,loc2);
break;
default: printf("\nWrong Input!! Try again!!!\n\n");
goto mainMenu;
}
goto subMenuEnd;
}
subMenuEnd:
break;
case 2: display();
break;
case 3: printf("How do you want to Delete: \n1. From Beginning\n2. From End\n3. Spes
ific\nEnter your choice: ");
scanf("%d",&choice1);
switch(choice1)
{
case 1: removeBeginning();
break;
case 2: removeEnd();
break;
 case 3: printf("Enter the value which you wanto delete: ");
scanf("%d",&loc2);
removeSpecific(loc2);
break;
default: printf("\nWrong Input!! Try again!!!\n\n");
goto mainMenu;
}
break;
case 4: exit(0);
default: printf("\nWrong input!!! Try again!!\n\n");
}
}
}

void removeBeginning()
{
if(head == NULL)
printf("\n\nList is Empty!!!");
else
{
struct Node *temp = head;
if(head->next == NULL)
{
head = NULL;
free(temp);
}
else
{
head = temp->next;
 free(temp);
printf("\nOne node deleted!!!\n\n");
}
}
}
void removeEnd()
{
if(head == NULL)
{
printf("\nList is Empty!!!\n");
}
else
{
struct Node *temp1 = head,*temp2;
if(head->next == NULL)
head = NULL;
else
{
while(temp1->next != NULL)
{
temp2 = temp1;
temp1 = temp1->next;
}
temp2->next = NULL;
}
free(temp1);
printf("\nOne node deleted!!!\n\n");
}
}
void removeSpecific(int delValue)
{
struct Node *temp1 = head, *temp2;
while(temp1->data != delValue)
{
if(temp1 -> next == NULL){
printf("\nGiven node not found in the list!!!");
goto functionEnd;
}
temp2 = temp1;
temp1 = temp1 -> next;
}
temp2 -> next = temp1 -> next;
free(temp1);
printf("\nOne node deleted!!!\n\n");
functionEnd:
}
void display()
{
if(head == NULL)
{
printf("\nList is Empty\n");
}
else
{
struct Node *temp = head;
printf("\n\nList elements are - \n");
while(temp->next != NULL)
{
printf("%d --->",temp->data);
temp = temp->next;
 }
printf("%d --->NULL",temp->data);
}
}
void insertAtEnd(int value)
{
struct Node *newNode;
newNode = (struct Node*)malloc(sizeof(struct Node));
newNode->data = value;
newNode->next = NULL;
if(head == NULL)
head = newNode;
else
{
struct Node *temp = head;
while(temp->next != NULL)
temp = temp->next;
temp->next = newNode;
}
printf("\nOne node inserted!!!\n");
}
 if(head == NULL)
head = newNode;

head

100
10 NULL

100
Head = newNode
 {
struct Node *temp = head;
while(temp->next != NULL)
temp = temp->next;
temp->next = newNode;
}

head
1000

first second Third

10 2000 20 3000 30 600

1000 2000 3000

3000
35 NULL

Newnode 6000 temp temp->next = 3000

Temp = temp->next = 6000