Showing posts with label Data Structure. Show all posts

C Program to implement Circular Queue.

Problems: Write a C program to implement a circular queue that contains a list of names.

Data Structure Definition:

Node: A node is a basic building block of a linked list. A node may contain different segments, but basically it contains two parts which are as followed,

Data or information part : It stores the data in the node

Link part : It points to the next node or holds the address to the next node.

Source Code:

#include<stdlib.h>
#include<stdio.h>
#include<string.h>
#define MAX 10

//defining the basic element of the queue
typedef struct Q
{
	int R,F;
	char *data[MAX];
}Q;

//declaration of functions
void initialise(Q *P);
int empty(Q *P);
int full(Q *P);
void enqueue(Q *P,char *x);
char * dequeue(Q *P);
void print(Q *P);

//main function
int main()
{	
	//intializing a node named queue
	Q q;
	
	//declaration and initialization fof variables
    int op;
    char x[40],*y;
    
    //initializ the queue
    initialise(&q);
        
	do{
			//displaying the menu
			printf("\n\n 1) Enqueue\n 2) Dequeue\n 3) Print\n 4) Quit");
			
			//inputting the input choice 
			printf("\n Enter Your Choice : ");
			scanf("%d",&op);
		
			//calling functions and passing arguments through the functions as per th choice of the user
			switch(op)
	 		{ 
			 	case 1: 
				 	printf("\n Enter string : ");
				    fflush(stdin);
		    		scanf("%s",x);
		    		if(!full(&q))
					{
						y=(char*)malloc(strlen(x)+1);
						strcpy(y,x);
						enqueue(&q,y);
					}
		    		else
						printf("\n Queue is full !!!!");
		        				break;
	   			case 2:	
				    if(!empty(&q))
		    		{
						y=dequeue(&q);
						printf("\n Deleted Data = %s",y);
		    		}
		   			else
						printf("\n Queue is empty !!!!");
		   				break;
	   			case 3: 
				   		print(&q);a
						break;
	}
      }while(op!=4);
}

//function to initialize a circular queue
void initialise(Q *P)
{
	//declaration of variable
	int i;
	//initializing the queue
	for(i=0;i<MAX;i++)
		P->data[i]=NULL;
	P->R=-1;
	P->F=-1;
}

//function to check if the queue is empty
int empty(Q *P)
{
	//if the queue is empty, return 1 else, return 0
	if(P->R==-1)
		return(1);
	return(0);
}

//function to check if the queue is full
int full(Q *P)
{
	//return 1 if the queue is full, else return 0
	if((P->R+1)%MAX==P->F)
		return(1);
	return(0);
}

//function to enqueue and element in the queue
void enqueue(Q *P,char *x)
{
	//enqueueing the element
	if(P->R==-1)
	{
		P->R=P->F=0;
		if(P->data[P->R]!=NULL)
			free(P->data[P->R]);
		P->data[P->R]=x;
	}
	else
	{
		P->R=(P->R+1)%MAX;
		if(P->data[P->R]!=NULL)
			free(P->data[P->R]);
		P->data[P->R]=x;
	}
}

//function to dequeue 
char * dequeue(Q *P)
{
	//declaring a character type pointer
	char *x;
	
	//dequeing the element from the queue
	x=P->data[P->F];
	if(P->R==P->F)
	{
		P->R=-1;
		P->F=-1;
	}
	else
		P->F=(P->F+1)%MAX;
	return(x);
}

//function to display the elements of the queue
void print(Q *P)
{
	int i;
	if(!empty(P))
	{
		printf("\n");
		for(i=P->F;i!=P->R;i=(i+1)%MAX)
			printf("%s\t",P->data[i]);
	}
       printf("%s\t",P->data[i]);
}

Output:

1) Enqueue

2) Dequeue

3) Print

4) Quit

Enter Your Choice : 1

Enter string : computer

1) Enqueue

2) Dequeue

3) Print

4) Quit

Enter Your Choice : 1

Enter string : science

1) Enqueue

2) Dequeue

3) Print

4) Quit

Enter Your Choice : 1

Enter string : honours

1) Enqueue

2) Dequeue

3) Print

4) Quit

Enter Your Choice : 3

computer science honours

1) Enqueue

2) Dequeue

3) Print

4) Quit

Enter Your Choice : 2

Deleted Data = computer

1) Enqueue

2) Dequeue

3) Print

4) Quit

Enter Your Choice : 2

Deleted Data = science

1) Enqueue

2) Dequeue

3) Print

4) Quit

Enter Your Choice : 2

Deleted Data = honours

1) Enqueue

2) Dequeue

3) Print

4) Quit

Enter Your Choice : 2

Queue is empty !!!!

Write a C program to implement queue using linked list | Brown Cote It

This is a C program which implements queue using linklist.

Source Code:

#include<stdio.h>
#include<conio.h>
#include<malloc.h>
//A structure is created for the node in
queue

struct queu
{
int info;
struct queu *next;//Next node address
};
typedef struct queu *NODE;
//This function will push an element into
the queue

NODE push(NODE rear)
{
NODE NewNode;
//New node is created to push the data
NewNode=(NODE)malloc(sizeof(struct queu));
printf ("\nEnter the no to be pushed =
");

scanf ("%d",&NewNode->info);
NewNode->next=NULL;
//setting the rear pointer
if (rear != NULL)
rear->next=NewNode;
rear=NewNode;
return(rear);
}
//This function will pop the element from
the queue

NODE pop(NODE f,NODE r)
{
//The Queue is empty when the front pointer
is NULL

if(f==NULL)
printf ("\nThe Queue is empty");
else
{
printf ("\nThe poped element is =
%d",f->info);

if(f != r)
f=f->next;
else
f=NULL;
}
return(f);
}
//Function to display the element of the
queue

void traverse(NODE fr,NODE re)
{
//The queue is empty when the front pointer
is NULL

if (fr==NULL)
printf ("\nThe Queue is empty");
else
{
printf ("\nThe element(s) is/are =
");

while(fr != re)
{
printf("%d ",fr->info);
fr=fr->next;
};
printf ("%d",fr->info);
}
}
int main()
{
int choice;
char option;
//declaring the front and rear pointer
NODE front, rear;
//Initializing the front and rear pointer to
NULL

front = rear = NULL;
do
{
//clrscr();
printf ("1. Push\n");
printf ("2. Pop\n");
printf ("3. Traverse\n");
printf ("\n\nEnter your choice =
");

scanf ("%d",&choice);
switch(choice)
{
case 1:
//calling the push function
rear = push(rear);
if (front==NULL)
{
front=rear;
}
break;
case 2:
//calling the pop function by passing
//front and rear pointers
front = pop(front,rear);
if (front == NULL)
rear = NULL;
break;
case 3:
traverse(front,rear);
break;
}
printf ("\n\nPress (Y/y) to continue =
");

fflush(stdin);
scanf ("%c",&option);
}while(option == 'Y' || option == 'y');
}

Output:

1. Push

2. Pop

3. Traverse

Enter your choice = 1

Enter the no to be pushed = 14

Press (Y/y) to continue = Y

1. Push

2. Pop

3. Traverse

Enter your choice = 1

Enter the no to be pushed = 25

Press (Y/y) to continue = Y

1. Push

2. Pop

3. Traverse

Enter your choice = 1

Enter the no to be pushed = 36

Press (Y/y) to continue = Y

1. Push

2. Pop

3. Traverse

Enter your choice = 2

The poped element is = 14

Press (Y/y) to continue = Y

1. Push

2. Pop

3. Traverse

Enter your choice = 3

The element(s) is/are = 25 36

Press (Y/y) to continue = N

Write a program to implement “QUEUE” using array. || BrownCodeIt

Data structure definition:-

The data structure Node represents a single node in the linked list]

Structure Node

( data to hold the relevant data value in a Node,

next that holds the address of the next Node

)

Source Code:

#include<conio.h>
#include<stdio.h>
#define max 5
int queue[max],front=0,rear=0;
int menu();
void enqueue();
void dequeue();
void display();
void main()
{
int ch;
clrscr();
printf("\nQueues using Arrays\n");
do
{
    ch=menu();
    switch(ch)
    {
    case 1: enqueue();
    break;
    case 2: dequeue();
    break;
    case 3: display();
    break;
    case 4: exit();
    break;
    default:printf("\n Please enter a valid choice!!");
    }
}while(1);
}

int menu()
    {
    int ch;
    printf("\n1.ENQUEUE \n2.DEQUEUE \n3.DISPLAY \n4.EXIT");
    printf("\nEnter your Choice:");
    scanf("%d",&ch);
    return ch;
    }

void enqueue()
{
    int element;
    if(rear==max)
    {
        printf("\nOverflow!!");
    }
    else
    {
        printf("\nEnter Element:");
        scanf("%d",&element);
        queue[rear++]=element;
        printf("\n %d Enqueued at %d",element,rear);
    }

}

void dequeue()
{
    if(rear==front)
    {
        printf("\nUnderflow!!");
    }
    else
    {
        front++;
        printf("\nElement is Dequeued from %d",front);
   }
}
void display()
{
    int i;
    if(front==rear)
    {
        printf("\nQueue is Empty!!!");
    }
    else
    {
        printf(" \n");
        for(i=front;i<max;i++)
        {
            printf(" | %d ",queue[i]);
        }
            printf("|");
    }
}

Output:

Queues using Arrays

1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your Choice:1

Enter Element:12

12 Enqueued at 1
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your Choice:1

Enter Element:23

23 Enqueued at 2
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your Choice:
23 Enqueued at 2
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your Choice:1

Enter Element:34

34 Enqueued at 3
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your Choice:1

Enter Element:45

45 Enqueued at 4
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your Choice:1

Enter Element:56

56 Enqueued at 5
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your Choice:2

Element is Dequeued from 1
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your Choice:2

Element is Dequeued from 2
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your Choice:3

| 34 | 45 | 56 |
1.ENQUEUE
2.DEQUEUE
3.DISPLAY
4.EXIT
Enter your Choice: 4

Write a Program in C to sort a linked list containing numbers using any sorting technique of your choice.

Write a Program in C to sort a linked list containing numbers using any sorting technique of your choice.

DATA STRUCTURE DEFINITION

_______________________________________________

NODE: Data {To store data in the Node}

Next {To store link of the next Node}

______________________________________________________________

Sorting of singly linked list Algorithm: https://browncodeit.blogspot.com/2020/06/an-algorithm-for-singly-linked-list-sorting.html

Coding in C

Source Code:

#include<stdio.h>
#include<conio.h>
#include<malloc.h>
 
//Definition of the data structure
struct node
{
  //parts of node
 int data;
 struct node *next;
};
 
//Rename of the data structure
typedef struct node node;
 
//Function prototype declarations
node *createlist (node *head);
node *sort(node *head);
void display(node *head);
int main()
{
   //Declaration of variable
  int c;
    node *head;
    //Allocation memory dynamically for the variable
    head = (node *)malloc(sizeof(node));
    do
      {
        //Displaying and calling the functions
        printf("\nCreation of a Linked List");
        head = createlist(head);
        printf("\nContents of Linked List :\n");
        display(head); 
        printf("\nSorting of Linked List :\n");
        head = sort(head);
        printf("\n Do you want to continue ? press 1 : ");
        scanf("%d",&c);
      }while(c==1);
        getch();
}
 
       //Function to create a linked list
node *createlist (node *head)
{
   //Declaration of variables
   int n, i;
   node *list;
   //Input total number
   printf("\nEnter total number of elements in the list : ");
   scanf("%d",&n);
   //Initioalizing the list by head pointer
   list = head;
   for( i = 0; i<n; i++)
      {
        printf("Enter data :");
        scanf("%d", &list->data);
           if( i == n-1)
               list->next = NULL;
           else 
             {                                 
               list->next=(node *)malloc(sizeof(node));
               list = list->next;               
             }
       }
        return head;
}
 
//Function to display a linked list
void display (node *head)
{
   //Declaration of variables
    node *list;
    //Initializing the list by pointer head
    list= head;
    while(list->next != NULL)
    {
               printf("%d ->",list->data);
               list = list -> next;
     }
     printf("%d\n",list->data);
 }

 //Funtion to sort a linked list
  node *sort(node *head)
  {
    //Declaration of Variables
   int temp;
   node *x,*y;
   for(x=head;x!=NULL;x=x->next)
    {
      for(y=x->next;y!=NULL;y=y->next)
         {
           if(x->data>y->data)
              {
               temp = x->data;
               x->data = y->data;
               y->data = temp;
               }
         }
    }

 //Print the linked list in sorted order
 printf("\nContents of Linked List in sorted order : \n");
 display(head);
 return head;
}

Output

Outputs:-

Creation of a Linked List

Enter total number of elements in the list : 3

Enter data :15

Enter data :12

Enter data :18

Contents of Linked List :

15 -> 12 -> 18

Sorting of Linked List :

Contents of Linked List in sorted order :

12 -> 15 -> 18

Do you want to continue ? press 1 : 1

Creation of a Linked List

Enter total number of elements in the list : 4

Enter data :66

Enter data :55

Enter data :

Enter data :77

Contents of Linked List :

66 -> 55 -> 44 -> 77

Sorting of Linked List :

Contents of Linked List in sorted order :

44 -> 55 -> 66 -> 77

Write a C program to implement the operations on a singly linked list.

Write a C program to implement the operations on a singly linked list. The program should include the following operations.

i. Creation of linked list

ii. Traversal of linked list

iii.Insertion of element---

( a). At the beginning of list

( b).At the end of list

( c).Before a given node

( d). After a given node

( e). At a given position

iv. Deletion of a node---

(a). First node

(b)Last node

(c). Node with a particular value

(d). Node at a given position

CODING in C:-

#include<stdio.h>
#include<malloc.h>
//Definition of the data structure
struct node
{
//parts of node
int data;
struct node *next;
};
//Rename of the data structure
typedef struct node node;
//Function prototype declarations
node *createlist (node *head);
void traverse (node *head);
node *insert (node *head);
node *insertbegin(node *head, int d);
node *insertend(node *head, int d);
node *insertbefore(node *head, int d);
node *insertafter(node *head, int d);
node *insertatparticularposition(node *head, int d);
node *delet(node *head);
node *deletbegin(node *head);
node *deletend(node *head);
node *deletvalue(node *head);
node *deletatparticularposition(node *head);
int main()
{
//Declaration of variable
char cont;
node *head;
//Allocation memory dynamically for the variable
head = (node *)malloc(sizeof(node));
do
{
//Displaying and calling the functions
printf("\nCreation of a Linked List");
head = createlist(head);
printf("\nContents of Linked List : \n");
traverse(head);
printf("\nInsertion of a new node : \n");
head = insert(head);
printf("\nDeletion of Node : \n");
head = delet(head);
printf("\n Do you want to continue ? (Y or N) : ");
scanf("%s",&cont);
}while(cont == 'Y' || cont =='y');
}
//Function to create a linked list
node *createlist (node *head)
{
//Declaration of variables
int n, i;
node *list;
//Inputt total number
printf("\nEnter total number of elements in the list : ");
scanf("%d", &n);
//Initioalizing the list by head pointer
list = head;
for ( i = 0; i<n; i++)
{
printf("Enter data :");
scanf("%d", &list->data);
if ( i == n-1)
list->next = NULL;
else
{
list->next=(node *)malloc(sizeof(node));
list = list->next;
}
}
return head;
}
//Function to traverse a linked list
void traverse (node *head)
{
//Declaration of variables
node *list;
//Initializing the list by pointer head
list = head;
while (list->next != NULL)
{
printf("%d -> ",list->data);
list = list -> next;
}
printf("%d\n", list->data);
}
//Function to insert nodes in a linked list
node *insert (node *head)
{
//declaring variables
int element, option;
//Inputt the data to insert
printf("Enter data to insert :");
scanf("%d", &element);
//Displaying insertion options
printf("Insertion options:");
printf("\n1. At the beginning");
printf("\n2. At the end");
printf("\n3. Before a key node");
printf("\n4. After a key node");
printf("\n5. At a particular position");
printf("\nEnter option : ");
//Inputt the insertion option
scanf("%d", &option);
switch(option)
{
//Calling of functions according to the oprtions
case 1:
head = insertbegin(head, element);
break;
case 2:
head = insertend(head, element);
break;
case 3:
head = insertbefore(head, element);
break;
case 4:
head = insertafter(head, element);
break;
case 5:
head = insertatparticularposition(head, element);
break;
//Printing the default case
default:
printf("\nInvalid choice. Insertion not done.");
}
printf("\nContents of Linked List after Insertion: \n");
traverse(head);
return head;
}
//Function to insert node at the begining
node *insertbegin(node *head, int d)
{
//Declaration of variable
node * tempnode;
//Allocating memory dynamically for the new node
tempnode = (node *)malloc(sizeof(node));
//Insert the new node at the begining
tempnode->data = d;
tempnode->next = head;
head = tempnode;
return head;
}
//Function to insert node at the end
node *insertend(node *head, int d)
{
//Declaration of variables
node *tempnode, *list;
//Allocating memory dynamically for the new node
tempnode = (node *)malloc(sizeof(node));
//Inputt the data into the new node
tempnode->data = d;
tempnode->next = NULL;
list = head;
while (list -> next != NULL)
list = list -> next;
list -> next = tempnode;
return head;
}
//Function to insert node before a particular node
node *insertbefore(node *head, int d)
{
//Declaration and initialization of variables
int key;
int found = 0;
node *tempnode, *list;
//Allocating memory dynamically for the new node
tempnode = (node *)malloc(sizeof(node));
//Inputt the data into the new node
tempnode->data = d;
printf("Enter value of key :") ;
scanf("%d",&key);
if ( head -> data == key)
{
//Insertion of the new node at the beginging
tempnode -> next = head;
head = tempnode;
return head;
}
list = head;
while (found == 0 && list -> next != NULL)
{
if (list -> next -> data == key)
{
tempnode -> next = list -> next;
list -> next = tempnode;
found = 1;
}
else
list = list -> next;
}
if ( found == 0)
printf ("Key Node not found!");
return head;
}
//Function to insert node after a particular node
node *insertafter (node *head, int d)
{
//Initialization and declaration of variables
int key;
int found = 0;
node *list, *tempnode;
//Allocating memory dynamically for the new node
tempnode = (node *)malloc(sizeof(node));
tempnode->data = d;
printf("Enter value of key :") ;
scanf("%d",&key);
list = head;
while (found == 0 && list != NULL)
{
if (list -> data == key)
{
tempnode -> next = list -> next;
list -> next = tempnode;
found = 1;
}
else
list = list -> next;
}
if ( found == 0)
printf ("Key Node not found!");
return head;
}
//Function to insert a node at a particular position
node *insertatparticularposition(node *head, int d)
{
//Declaration and initialization of variables
int keyposition;
int currentposition=1;
int validposition=0;
node *list, *tempnode;
//Dynamically allocation of memory for the new node
tempnode = (node *)malloc(sizeof(node));
tempnode->data = d;
//Input value of keynode
printf("Enter the position :") ;
scanf("%d",&keyposition);
list=head;
//If the position is in first location
if(keyposition==0)
{
//Insert the new node at the begining
tempnode -> next = head;
head=tempnode;
return head;
}
//Inserting the new node at the particular location
while(validposition==0 && list !=NULL)
{
if(currentposition==keyposition)
{
tempnode -> next = list -> next;
list -> next = tempnode;
validposition=1;
}
else
{
currentposition=currentposition+1;
list=list -> next;
}
}
if(validposition==0)
{
printf("Invalid Position.");
}
return head;
}
//Function to delete the nodes of a linked list
node *delet(node *head)
{
//Initializing the option variable
int option;
//Displaying the deletion options
printf("Deletion options:");
printf("\n1. Deletion of First Node");
printf("\n2. Deletion of Last Node");
printf("\n3. Deletion of node with a particular value");
printf("\n4. Deletion of a node at a given position");
printf("\nEnter option : ");
scanf("%d", &option);
switch(option)
{
case 1:
head = deletbegin(head);
break;
case 2:
head = deletend(head);
break;
case 3:
head = deletvalue(head);
break;
case 4:
head = deletatparticularposition(head);
break;
//Diplaying the default option
default:
printf("\nInvalid choice. Deletion not done.");
}
printf("\nContents of Linked List after Deletion: \n");
traverse(head);
return head;
}
//Function to delete the first node of the list
node *deletbegin(node *head)
{
//Declaring the variables
node *delnode, *list;
//If list does not exist
if (head == NULL)
{
printf("Empty List");
return NULL;
}
//initializing the variable delnode with head
delnode = head;
//Deleting the first node
head = head -> next;
//Deallocating the deleted node
free(delnode);
return head;
}
//Function to delete the last node if a list
node *deletend(node *head)
{
//Declaring the variables
node *delnode, *list;
//If the list does not exist
if (head == NULL)
{
printf("Empty List");
return NULL;
}
//If the node to be deleted is the first node
if (head -> next == NULL)
{
//Deleting the node
delnode=head;
head = NULL;
free(delnode);
return(head);
}
list = head;
//Deleting the node
while( list -> next -> next != NULL )
list = list -> next;
delnode = list -> next;
list -> next = NULL;
//Deallocating the deleted node
free(delnode);
return(head);
}
//Function to delete a node with a particular value
node *deletvalue(node *head)
{
//Declaration and initialization of variables
int key, found = 0;
node *delnode, *list;
//Inputt the value
printf("Enter value of node that you want to delete : ");
scanf("%d", &key);
//If the list is empty
if (head == NULL)
{
printf("Empty List");
return NULL;
}
//If the first node is the node with the value
if (head -> data == key)
{
//Deleting the node
delnode=head;
head = head-> next;
free(delnode);
return(head);
}
list = head;
//Deletion of that particular valued node
while(list -> next != NULL && found == 0)
{
if(list -> next -> data == key)
{
found = 1;
delnode=list->next;
list->next = list -> next -> next;
//Deallocating the node
free(delnode);
return(head);
}
list=list->next;
}
if(found==0)
printf("Node not found");
return(head);
}
//Deleting a node at a particular position
node *deletatparticularposition(node *head)
{
//Declaration and initialization of variables
int pos,cnt=1;
//Input the value
printf("Enter position of node that you want to delete : ");
scanf("%d", &pos);
node *p=head,*tmp;
//To check valid position
if(pos<1 || pos>countNodes(head))
printf("\nWrong position value, try again:");
else
{
if(pos==1)//if position is 1
{
p=head;
head=head->next;
}
else//if position is more than 1
{
while(cnt<pos)
{
cnt++;
tmp=p;
p=p->next;
}
tmp->next=p->next;//insert node
}
free(p);
}
return head;
}
int countNodes(node *head)
{
//Declaration and initialization of variables
int count=0;
node *p;
p=head;
//Count the number of nodes
while(p!=NULL)
{
count++;
p=p->next;
}
return(count);
}

OUTPUTS :-

OUTPUT 1 :-

Creation of a Linked List

Enter total number of elements in the list : 3

Enter data :23

Enter data :34

Enter data :45

Contents of Linked List :

23 -> 34 -> 45

Insertion of a new node :

Enter data to insert :12

Insertion options:

1. At the beginning

2. At the end

3. Before a key node

4. After a key node

5. At a particular position

Enter option : 1

Contents of Linked List after Insertion:

12 -> 23 -> 34 -> 45

Deletion of Node :

Deletion options:

1. Deletion of First Node

2. Deletion of Last Node

3. Deletion of node with a particular value

4. Deletion of a node at a given position

Enter option : 1

Contents of Linked List after Deletion:

23 -> 34 -> 45

OUTPUT 2 :-

Creation of a Linked List

Enter total number of elements in the list : 3

Enter data :12

Enter data :23

Enter data :34

Contents of Linked List :

12 -> 23 -> 34

Insertion of a new node :

Enter data to insert :45

Insertion options:

1. At the beginning

2. At the end

3. Before a key node

4. After a key node

5. At a particular position

Enter option : 2

Contents of Linked List after Insertion:

12 -> 23 -> 34 -> 45

Deletion of Node :

Deletion options:

1. Deletion of First Node

2. Deletion of Last Node

3. Deletion of node with a particular value

4. Deletion of a node at a given position

Enter option : 2

Contents of Linked List after Deletion:

12 -> 23 -> 34

OUTPUT 3:-

Creation of a Linked List

Enter total number of elements in the list : 3

Enter data :12

Enter data :23

Enter data :45

Contents of Linked List :

12 -> 23 -> 45

Insertion of a new node :

Enter data to insert :34

Insertion options:

1. At the beginning

2. At the end

3. Before a key node

4. After a key node

5. At a particular position

Enter option : 3

Enter value of key :45

Contents of Linked List after Insertion:

12 -> 23 -> 34 -> 45

Deletion of Node :

Deletion options:

1. Deletion of First Node

2. Deletion of Last Node

3. Deletion of node with a particular value

4. Deletion of a node at a given position

Enter option : 3

Enter value of node that you want to delete : 45

Contents of Linked List after Deletion:

12 -> 23 -> 34

OUTPUT 4:-

Creation of a Linked List

Enter total number of elements in the list : 3

Enter data :12

Enter data :23

Enter data :34

Contents of Linked List :

12 -> 23 -> 34

Insertion of a new node :

Enter data to insert :31

Insertion options:

1. At the beginning

2. At the end

3. Before a key node

4. After a key node

5. At a particular position

Enter option : 4

Enter value of key :23

Contents of Linked List after Insertion:

12 -> 23 -> 31 -> 34

Deletion of Node :

Deletion options:

1. Deletion of First Node

2. Deletion of Last Node

3. Deletion of node with a particular value

4. Deletion of a node at a given position

Enter option : 4

Enter position of node that you want to delete : 4

Contents of Linked List after Deletion:

12 -> 23 -> 31

Pyapiras

C Program to implement Circular Queue.

Problems: Write a C program to implement a circular queue that contains a list of names.

Source Code:

Output:

Write a C program to implement queue using linked list | Brown Cote It

Write a program to implement “QUEUE” using array. || BrownCodeIt

Source Code:

Output:

Write a Program in C to sort a linked list containing numbers using any sorting technique of your choice.

Outputs:-

Write a C program to implement the operations on a singly linked list.

CODING in C:-

OUTPUT 1 :-

OUTPUT 2 :-

Popular Posts

Report Abuse

Topics

Services

Our Information

About