-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathKuyrukYapisiveTekYonluBagliListe.c
157 lines (145 loc) · 2.9 KB
/
KuyrukYapisiveTekYonluBagliListe.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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
#include <stdio.h>
#include <stdlib.h>
typedef struct Kuyruk
{
int data;
struct Kuyruk *next;
};
struct Kuyruk *root;
int size=0;
void Enqueu(int data)
{
if(size==0)
{
root = (struct Kuyruk*)malloc(sizeof(struct Kuyruk));
root->data = data;
root->next = NULL;
size++;
}
else
{
struct Kuyruk *iter = (struct Kuyruk*)malloc(sizeof(struct Kuyruk));
iter->data = data;
iter->next=root;
size++;
root = iter;
}
}
int Dequeu()
{
int i;
if(size==0)
{
return -1;
}
if(size==1)
{
int result = root->data;
root=NULL;
size--;
return result;
}
else
{
struct Kuyruk *iter = root;
for(i=0; i<size-2; i++)
{
iter=iter->next;
}
struct Kuyruk *temp = iter->next;
int result = iter->next->data;
iter->next = NULL;
free(temp);
size--;
return result;
}
}
void Listele()
{
int i;
struct Kuyruk *iter = root;
printf("\n");
for(i=0; i<size; i++)
{
printf("%d -> ", iter->data);
iter=iter->next;
}
}
void EnqueuSondan(int data)
{
if(size==0)
{
root = (struct Kuyruk*)malloc(sizeof(struct Kuyruk));
root->data = data;
root->next = NULL;
size++;
}
else
{
struct Kuyruk *iter = root;
struct Kuyruk *temp = (struct Kuyruk*)malloc(sizeof(struct Kuyruk));
while(iter->next != NULL)
{
iter = iter->next;
}
temp->data = data;
iter->next = temp;
temp->next = NULL;
size++;
}
}
int DequeuBastan()
{
int i;
if(size==0)
{
return -1;
}
if(size==1)
{
int result = root->data;
root=NULL;
size--;
return result;
}
else
{
struct Kuyruk *temp = root;
int result = root->data;
root=root->next;
free(temp);
size--;
return result;
}
}
int main()
{
/*
Enqueu(10);
Enqueu(20);
Enqueu(30);
Listele();
Enqueu(40);
Enqueu(50);
Listele();
printf("\nDequeu : %d\n", Dequeu());
printf("Dequeu : %d\n", Dequeu());
Listele();
printf("\nDequeu : %d\n", Dequeu());
printf("Dequeu : %d\n", Dequeu());
Listele();*/
EnqueuSondan(10);
EnqueuSondan(20);
EnqueuSondan(30);
Listele();
EnqueuSondan(40);
EnqueuSondan(50);
Listele();
printf("\nDequeu : %d\n", DequeuBastan());
printf("Dequeu : %d\n", DequeuBastan());
Listele();
printf("\nDequeu : %d\n", DequeuBastan());
printf("Dequeu : %d\n", DequeuBastan());
Listele();
return 0;
}