forked from I-RoshanKumar/Beginner_Hactoberfest2022
-
Notifications
You must be signed in to change notification settings - Fork 0
/
12_del_at_end_janny.c
74 lines (65 loc) · 1.31 KB
/
12_del_at_end_janny.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include<stdio.h>
#include<stdlib.h>
struct node*Display(struct node *head);
struct node*del_at_end(struct node*head);
struct node
{
int data;
struct node *next;
/* data */
};
int main()
{
struct node *new_node,*temp,*head;
head=0;
int choice=1;
while (choice!=0)
{
new_node=(struct node*)malloc(sizeof(struct node));
printf("Enter the data");
scanf("%d",&new_node->data);
new_node->next=NULL;
if(head==0)
{
head=temp=new_node;
}
else
{
temp->next=new_node;
temp=new_node;
}
printf("if you enter again then press 1,stop 0");
scanf("%d",&choice);
}
Display(head);
printf("after deleat");
head=del_at_end(head);
Display(head);
}
struct node*Display(struct node *head)
{
while(head!=0)
{
printf("%d\n",head->data);
head=head->next;
}
}
struct node*del_at_end(struct node*head)
{
struct node*temp,*prev;
temp=head;
while (temp->next!=0)
{
prev=temp;
temp=temp->next;
}
if(temp==head)
{
head=0;
}
else{
prev->next=0;
}
free(temp);
return head;
}