Skip to content

Added UDF LL and DLL #91

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Added UDF LL and DLL #91

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
892b6f2
Added UDF LL and DLL
falconcode16 Oct 24, 2021
9edb728
Add files via upload
falconcode16 Jan 7, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
176 changes: 176 additions & 0 deletions Linkedlist/Doubly Linked list program(UDF).c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,176 @@
#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *next;
struct node *prev;
};
typedef struct node NODE;
NODE *LLnode,*head,*temp,*prev;
NODE* insert_at_front(NODE *);
NODE* insert_at_end(NODE *);
NODE* delete_at_front(NODE *);
NODE* delete_at_end(NODE *);
void display(NODE *);


main()
{
int ch;
head=NULL;

do
{
printf("1--insert node at the front\n");
printf("2--insert node at the end\n");
printf("3--delete a node at the front\n");
printf("4--delete a node at the end\n");
printf("5--display the linked list\n");
printf("6--close the program\n");

printf("enter your choice\n");
scanf("%d",&ch);
switch(ch)
{
case 1: head=insert_at_front(head);

break;
case 2: head=insert_at_end(head);

break;
case 3:head=delete_at_front(head);

break;
case 4: head=delete_at_end(head);

break;
case 5: display(head);
break;
case 6: exit(0);break;
default:printf("Invalid choice\n");
break;
}
}while(ch!=6);


}
NODE* insert_at_front(NODE *head)
{
LLnode=(NODE *)malloc(sizeof(NODE));
printf("enter the data\n");
scanf("%d",&LLnode->data);

if(head==NULL)
{
head=LLnode;
head->next=NULL;
head->prev=NULL;
}
else
{
LLnode->next=head;
head=LLnode;
head->prev=NULL;
}
return(head);

}

NODE* insert_at_end(NODE *head)
{
LLnode=(NODE *)malloc(sizeof(NODE));
printf("enter the data\n");
scanf("%d",&LLnode->data);
LLnode->next=NULL;
if(head==NULL)
{
head=LLnode;
head->next=NULL;
head->prev=NULL;
}
else
{
temp=head;
while(temp->next!=NULL)
{
temp=temp->next;
}
temp->next=LLnode;
LLnode->prev=temp;
LLnode->next=NULL;
}
return(head);

}

NODE* delete_at_front(NODE *head)
{
if(head==NULL)
{
printf("Linked list is empty...cant delete a node\n");
}
else if(head->next==NULL)
{
//temp=head;
printf("node deleted=%d\n",head->data);
free(head);
head=NULL;
}
else
{
temp=head->next;
printf("node deleted=%d\n",head->data);
free(head);
head=temp;
head->prev=NULL;
}
return(head);
}

NODE* delete_at_end(NODE *head)
{
if(head==NULL)
{
printf("Linked list is empty...cant delete a node\n");
}
else if(head->next==NULL)
{
printf("node deleted=%d\n",head->data);
free(head);
head=NULL;
}
else
{
temp=head;
while(temp->next!=NULL)
{
prev=temp;
temp=temp->next;
}
printf("node deleted=%d\n",temp->data);
free(temp);
prev->next=NULL;
}
return(head);
}


void display(NODE *head)
{
if(head==NULL)
{
printf("Linked list is empty\n");
}
else
{
printf("the linked list is as below\n");
temp=head;
while(temp!=NULL)
{
printf("%d->",temp->data);
temp=temp->next;
}
printf("\n");
}
}
164 changes: 164 additions & 0 deletions Linkedlist/Linked list program(UDF).c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,164 @@
#include<stdio.h>
#include<stdlib.h>
struct CET
{
char name[20];
int marks;
char city[20];
int phone;
struct CET *next;
};
typedef struct CET NODE;
NODE *LLnode,*head,*temp,*prev;
NODE* insert_at_front(NODE *);
NODE* insert_at_end(NODE *);
NODE* delete_at_front(NODE *);
NODE* delete_at_end(NODE *);
void display(NODE *);


main()
{
int ch;
head=NULL;

do
{
printf("1--insert node at the front\n");
printf("2--insert node at the end\n");
printf("3--delete a node at the front\n");
printf("4--delete a node at the end\n");
printf("5--display the linked list\n");
printf("6--close the program\n");

printf("enter your choice\n");
scanf("%d",&ch);
switch(ch)
{
case 1: head=insert_at_front(head);

break;
case 2: head=insert_at_end(head);

break;
case 3:head=delete_at_front(head);

break;
case 4: head=delete_at_end(head);

break;
case 5: display(head);
break;
case 6: exit(0);break;
default:printf("Invalid choice\n");
break;
}
}while(ch!=6);


}
NODE* insert_at_front(NODE *head)
{
LLnode=(NODE *)malloc(sizeof(NODE));
printf("enter the name, marks, city, phone\n");
scanf("%s%d%s%d",&LLnode->name,&LLnode->marks,&LLnode->city,&LLnode->phone);

if(head==NULL)
{
head=LLnode;
head->next=NULL;
}
else
{
LLnode->next=head;
head=LLnode;
}
return(head);

}

NODE* insert_at_end(NODE *head)
{
LLnode=(NODE *)malloc(sizeof(NODE));
printf("enter the name, marks, city, phone\n");
scanf("%s%d%s%d",&LLnode->name,&LLnode->marks,&LLnode->city,&LLnode->phone);
LLnode->next=NULL;
if(head==NULL)
{
head=LLnode;
}
else
{
temp=head;
while(temp->next!=NULL)
{
temp=temp->next;
}
temp->next=LLnode;
}
return(head);

}

NODE* delete_at_front(NODE *head)
{
if(head==NULL)
{
printf("Linked list is empty...cant delete a node\n");
}
else
{
temp=head;
printf("node deleted=%s%d%s%d\n",temp->name,temp->marks,temp->city,temp->phone);
head=head->next;
free(temp);
}
return(head);
}

NODE* delete_at_end(NODE *head)
{
if(head==NULL)
{
printf("Linked list is empty...cant delete a node\n");
}
else if(head->next==NULL)
{
printf("node deleted=%s%d%s%d\n",temp->name,temp->marks,temp->city,temp->phone);
free(head);
head=NULL;
}
else
{
temp=head;
while(temp->next!=NULL)
{
prev=temp;
temp=temp->next;
}
printf("node deleted=%s%d%s%d\n",temp->name,temp->marks,temp->city,temp->phone);
free(temp);
prev->next=NULL;
}
return(head);
}


void display(NODE *head)
{
if(head==NULL)
{
printf("Students data list is empty\n");
}
else
{
printf("Students information is as below\n");
temp=head;
while(temp!=NULL)
{
printf("name= %s\nmarks= %d\ncity= %s\nphone= %d\n",temp->name,temp->marks,temp->city,temp->phone);
temp=temp->next;
}
printf("\n");
}
}
Loading