Skip to main content

C Program To Implement Singly Linked List.

A linked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node contains one or more data fields and a reference to the next node. The last node points to a null reference to indicate the end of the list. 

 The entry point into a linked list is the head of the list. Head is not a separate node, but a reference to the first Node in the list. If the list is empty, then the head has the value null. Linked list allows for efficient insertion, deletion, and traversal of elements in the sequence.

Example: A singly linked list whose nodes contain two fields: an integer value and a link to the next node. The last node is linked to a terminator used to signify the end of the list.



Source code of Singly Linked List:
# include<stdio.h>
# include<stdlib.h>

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

void append(struct node **,int);
void in_begin(struct node **,int);
void del(struct node **,int);

void in_middle(struct node **,int,int);
int count(struct node *);
void display(struct node *);

int main() {
struct node *p; /* p can be said as the head or a start ptr */
p=NULL;
/* Printing the menu */
int num,loc;
char choice;

while(1) {
fflush(stdin);
printf("\nPROGRAM TO IMPLEMENT SINGLY LINKED LIST ");
printf("\n=======================================");
printf("\n\n1. Create / Appending The List");
printf("\n2. Insert Node At Begining");
printf("\n3. Insert Node In Middle");
printf("\n4. Deleting A Node");
printf("\n5. Counting The No. Of Nodes");
printf("\n6. Displaying the List");
printf("\n7. Exit");
printf("\n\nEnter Your Choice : ");
scanf("%c",&choice);

switch(choice) {
case '1': {
char ans;
int a=1;

while(a) {
printf("Enter Any Number : ");
scanf("%d",&num);

append(&p,num);
fflush(stdin);
printf("Enter More (y/n) : ");
scanf("%c",&ans);

if(ans=='n')
a=0;
}
break;
}

case '2':
printf("Enter The Data : ");
scanf("%d",&num);
in_begin(&p,num);
break;

case '3':
printf("\nEnter The Position : ");
scanf("%d",&loc);
printf("\nEnter The Data : ");
scanf("%d",&num);
in_middle(&p,loc,num);
break;

case '4':
printf("\nEnter The Data You Want To Delete : ");
scanf("%d",&num);
del(&p,num);
break;

case '5':
printf("\nThe No Of Nodes Are %d \n",count(p));
break;

case '6':
display(p);
break;

case '7':
return 0;

default:
printf("Invalid choice. Please Enter Correct Choice. \n\n");
break;
}}
return 0;
}

void append(struct node **q,int num) {
struct node *temp,*r;
temp = *q;

if(*q==NULL) {
temp = (struct node *)malloc(sizeof(struct node));
temp->data=num;
temp->link=NULL;
*q=temp;
}

else {
temp = *q;

while(temp->link !=NULL) {
temp=temp->link;
}

r = (struct node *)malloc(sizeof(struct node));
r->data=num;
r->link=NULL;
temp->link=r;
}}

void display(struct node *q) {
if(q==NULL) {
printf("\nEmpty Linked List. Can't Display The Data\n");
}

else
while(q!=NULL) {
printf("\t%d",q->data);
q=q->link;
}
printf("\n");
}

int count(struct node *q) {
int c=0;

if(q==NULL) {
printf("Empty Linked List.\n");
goto last;
}

while(q!=NULL) {
c++;
q=q->link;
}
last:
return c;
}

void in_begin(struct node **q,int num) {
struct node *temp;

if(*q==NULL) {
printf("\nLinked List Is Empty. Can't Insert.\n\n");
}

else {
temp=(struct node *)malloc(sizeof(struct node));
temp->data=num;
temp->link=*q;
*q=temp; /* pointing to the first node */
}}

void in_middle(struct node **q,int loc,int num) {
struct node *temp,*n;
int c=1,flag=0;
temp=*q;

if(*q==NULL) { printf("\nLinked List Is Empty. Can't Insert.\n\n");
}

else
while(temp!=NULL) {

if(c==loc) {
n = (struct node *)malloc(sizeof(struct node));
n->data=num;
n->link=temp->link;
temp->link=n;
flag=1;
}
c++;
temp=temp->link;
}

if(flag==0) {
printf("\nNode Specified Doesn't Exist. Can't Enter The Data.\n\n");
}

else { printf("\nData Inserted.\n");
}}

void del(struct node**q,int num) {
if(*q==NULL) {
printf("\nEmpty Linked List. Can't Delete The Data.\n\n");
}

else {
struct node *old,*temp;

old=(struct node*)malloc(sizeof(struct node));
int flag=0;
temp=*q;

while(temp!=NULL) {
if(temp->data==num) {
if(temp==*q) /* First Node case */
*q=temp->link; /* shifted the header node */

else old->link=temp->link;
free(temp);
flag=1;
break;
}

else {
old=temp;
temp=temp->link;
}}

if(flag==0)
printf("\nData Not Found...\n");
else
printf("\nData Deleted...\n");
}}
Labels:

Popular posts from this blog

Screenshots from Windows 1.01

Windows 1.0 is a graphical personal computer operating environment developed by Microsoft, released on November 20, 1985, as the first version of the Microsoft Windows line. Version 1.01 , also released in 1985, was the first point-release after Windows 1.00.   Screenshots from Windows 1.01: ⇰ Desktop  First Run Empty Desktop Desktop With Applications ⇰  Office Applications Notepad Text Editor Calculator Calendar Clock Address Book ⇰  Multimedia Applications Media player, CD player, Volume level, and Sound: This GUI doesn’t have these features. ⇰  Networking Applications Terminal Phone Dialer: This GUI doesn’t have this feature. ⇰  Internet Applications Browser, and Mail: This GUI doesn’t have these features. ⇰  Accessibility Applications Keyboard Map:  This GUI doesn’t have this feature. ⇰  Settings Desktop themes,  Display,  S...
Read more

C++ Program To Implement Casino Number Guessing Game.

#include <iostream> #include <string> #include <cstdlib> #include <ctime> using namespace std; void drawLine(int n, char symbol); void rules(); int main() { string playerName; int amount; int bettingAmount; int guess; int dice; char choice; srand(time(0)); drawLine(70,'_'); cout << "\n\n\n\t\tCASINO GAME\n\n\n\n"; drawLine(70,'_'); cout << "\n\nEnter Your Name : "; getline(cin, playerName); cout << "\n\nEnter Deposit Amount To Play Game : $"; cin >> amount;
Read more

Introduction To Algorithms, 3rd Edition

Before there were computers, there were algorithms. But now that there are computers, there are even more algorithms, and algorithms lie at the heart of computing. This book provides a comprehensive introduction to the modern study of computer algorithms. It presents many algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. In this book, the authors tried to keep explanations elementary without sacrificing depth of coverage or mathematical rigor. Each chapter presents an algorithm, a design technique, an application area, or a related topic. Algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The book contains 244 figures — many with multiple parts — illustrating how the algorithms work. It also includes careful analysis of the running times of all algorithms. In this third edition, the entire book once again updated including changes cove...
Read more

C++ Program To Implement Student Report Card System.

#include<iostream> #include<fstream> #include<iomanip> #include <cstdlib> using namespace std; class student { int rollno; char name[50]; int p_marks, c_marks, m_marks, e_marks, cs_marks; double per; char grade; void calculate(); public: void getdata(); void showdata() const; void show_tabular() const; int retrollno() const; }; void student::calculate() { per=(p_marks+c_marks+m_marks+e_marks+cs_marks)/5.0; if(per>=60) grade='A'; else if(per>=50)  grade='B'; else if(per>=33) grade='C'; else grade='F'; }
Read more