SIMPLE AND BASIC LINKED LIST OPERATIONS

SIMPLE AND BASIC LINKED LIST OPERATIONS 


In This Post I'm Going To Demonstrate you Simple Operations On Linked List i.e.

(1) Addition Of Nodes

(2) Deletion Of Nodes

(3) Traversing The List and

(4) Search A Data from List 

THE CODE IS AS FOLLOWING :-

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
typedef struct ll
{
struct ll *next;
int digit;
}mynode;
mynode *head,*start,*new1;
void addnode(mynode **hd,int data);
void delnode(mynode **hd,int data);
void traverse(mynode *hd);
void search(mynode *hd,int data);
void main()
{
int choice,data;
head=(mynode*)malloc(sizeof(mynode));
head->next=NULL;
clrscr();
do
{
printf("\nEnter Choice : ");
printf("\n1.ADD NODE");
printf("\n2.DELETE NODE");
printf("\n3.TRAVERSE OR READ LIST");
printf("\n4.SEARCH NODE");
printf("\n5.EXIT");
printf("\nEnter Choice : ");
scanf("%d",&choice);
switch(choice)
{
case 1:
printf("\nEnter A Number ");
scanf("%d",&data);
addnode(&head,data);
break;
case 2:
printf("\nEnter Data To Delete : ");
scanf("%d",&data);
delnode(&head,data);
break;
case 3:
traverse(head);
break;
case 4:
printf("\nEnter Data To Search : ");
scanf("%d",&data);
search(head,data);
break;
case 5:
printf("\nTHANKS FOR USING ME !! HAVE A NICE DAY , BYE BYE  %c!! ",1);
getch();
exit(0);
break;
default:
printf("\nINVALID CHOICE RE-ENTER\n");
break;
}//switch
}while(choice!=5);
}
void addnode(mynode **hd,int data)
{
mynode *new1,*head;
head=*hd;
new1=(mynode*)malloc(sizeof(mynode));
new1->next=NULL;
new1->digit=data;
if(head->next==NULL)
{
head->next=new1;
printf("\nFIRST NODE ADDED");
return;
}
while(head->next!=NULL)
head=head->next;
head->next=new1;
printf("\n%d IS ADDED ! ",data);
}
void delnode(mynode **hd,int data)
{
mynode *temp,*prev;
temp=*hd;
clrscr();
if(temp->next==NULL)
{
printf("\nNOTHING TO DELETE");
return;
}
if(temp->next->next==NULL)
{
if(temp->next->digit!=data)
{
printf("\nDATA NOT FOUND IN SINGLE NODE");
return;
}
temp=temp->next;
printf("\nWARNING : SINGLE DATA DELETED ");
prev=*hd;
prev->next=NULL;
free(temp);
printf("\n%d IS DELETED !!",data);
return;
}
prev=*hd;
while(temp->next!=NULL)
{
temp=temp->next;
if(temp->digit==data)
{
prev->next=temp->next;
free(temp);
printf("\n%d IS DELETED",data);
return;
}//if
else
prev=prev->next;
}//while
printf("\nDATA NOT FOUND");
}
void traverse(mynode *hd)
{
mynode *temp=hd;
clrscr();
printf("\nData Available Are: \n");
if(temp->next==NULL)
{
printf("\nNOTHING");
return;
}
while(hd->next!=NULL)
{
hd=hd->next;
printf("%d,",hd->digit);
}
}
void search(mynode *hd,int data)
{
mynode *temp;
temp=hd;
clrscr();
while(temp->next!=NULL)
{
temp=temp->next;
if(temp->digit==data)
{
printf("\nData Found");
return;
}
}
printf("\nNOT FOUND");
}
                                                          !!! HOPE U LIKE IT !!!
                                                  !!!  THANKS FOR READING !!!
                                                  !!!!!HAPPY PROGRAMMING !!!!!
U Can catch me at http://www.facebook.com/salokr


Location: Pandeypur, Uttar Pradesh, India

Comments

Post a Comment

Popular posts from this blog

Program To Evaluate Square Root Of A Number

Program To Evaluate Square Root Of A Number :- #include<stdio.h> #include<conio.h> void main() { float a,q,b,i; clrscr(); printf("Enter Any Number : "); scanf("%f",&q); a=b=q/2; for(i=0;i<50;i++) { b=((a+(q/b))/2); a=b; } printf("The Square Root Of %f Is -> %f",q,b); getch(); }                              THIS EVALUATION  IS BASED ON BABYLONIAN METHOD Square roots by Divide-and-Average This method dating back to the Babylonians (1700 B.C.) is known as the Babylonian Algorithm. If A > 0 is a guess of the square root of the positive number Q, then a better approximation to √Q is given by B = (A + Q/A)/2. Now you use B as an approximation and compute C = (B + Q/B)/2, and so on to get as close as you want to the value of √Q. We have shown elsewhere why the Babylonian Algorithm works. Examp...
Read more

TIC-TAC-TOE THROUGH C

IMPLEMENTATION OF TIC-TAC-TOE THROUGH C :- From Wikipedia, the free encyclopedia. Tic-tac-toe, originally called noughts and crosses (and still known as this in Britain and Australia), Xs and Os (in Ireland) and X and 0 (in India) is a pencil-and-paper game for two players, X and O, who take turns marking the spaces in a 3×3 grid. The player who succeeds in placing three respective marks in a horizontal, vertical, or diagonal row wins the game. The following example game is won by the first player, X: Players soon discover that best play from both parties leads to a draw (often referred to as cat or cat's game). Hence, tic-tac-toe is most often played by young children. The friendliness of tic-tac-toe games makes them ideal as a pedagogical tool for teaching the concepts of good sportsmanship and the branch of artificial intelligence that deals with the searching of game trees. It is straightforward to write a computer program to play tic-tac-toe perfectly,...
Read more

LINKED LIST IMPLEMENTATION FOR GAME BATTLESHIP THROUGH C

LINKED LIST IMPLEMENTATION FOR GAME BATTLESHIP THROUGH C The game is played on four  grids , two for each player. The grids are typically square – usually 10×10 – and the individual squares in the grid are identified by letter and number. On one grid the player arranges ships and records the shots by the opponent. On the other grid the player records his/her own shots. Before play begins, each player secretly arranges their ships on their primary grid. Each ship occupies a number of consecutive squares on the grid, arranged either horizontally or vertically. The number of squares for each ship is determined by the type of the ship. The ships cannot overlap (i.e., only one ship can occupy any given square in the grid). The types and numbers of ships allowed are the same for each player. These may vary depending on the rules. REF:-  http://en.wikipedia.org/wiki/Battleship_(game) I have used Linked List For It's Implementation One Can Use Array too.....  _...
Read more