-
Notifications
You must be signed in to change notification settings - Fork 0
/
LinkedList.cpp
85 lines (84 loc) · 1005 Bytes
/
LinkedList.cpp
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
75
76
77
78
79
80
81
82
83
84
85
// Implementation of LinkedList
#include<bits/stdc++.h>
#define ll long long
using namespace std;
typedef struct node
{
int num;
struct node *ptr;
}node;
node *head,*first,*temp=0;
void insert(int n)
{
first=0;
for(int i=0;i<n;++i)
{
head=new node;
cin>>head->num;
if(first!=0)
{
temp->ptr=head;
temp=head;
}
else
{
first=temp=head;
}
temp->ptr=0;
}
}
void print()
{
temp=first;
while(temp!=0)
{
cout<<temp->num<<" ";
temp=temp->ptr;
}
cout<<"\n";
}
void delete_node(int x)
{
temp=first;
head=first;
if(temp->num==x)
{
first=temp->ptr;
return;
}
while(temp!=0 && temp->num!=x)
{
head=temp;
temp=temp->ptr;
}
head->ptr=temp->ptr;
free(temp);
}
void add(int b)
{
temp=first;
while(temp->ptr!=0)
{
temp=temp->ptr;
}
head=new node;
head->num=b;
head->ptr=NULL;
temp->ptr=head;
temp=head;
temp->ptr=NULL;
}
int main()
{
int n;
cin>>n;
insert(n);
print();
int m;
cin>>m;
delete_node(m);
print();
add(7);
print();
return 0;
}