-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.c
147 lines (127 loc) · 2.45 KB
/
main.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
#include <stdio.h>
#include <stdlib.h>
/*
* Autor : Octavian
* C Lab
*
*/
struct nod{
int cheie;
char info[10];
struct nod *urm;
};
typedef struct nod Tnod;
typedef Tnod *ref;
ref p, q, r, s;
void ins_p(void)
{
q = (ref)malloc(sizeof(Tnod));
printf("Introduceti cheia: ");
scanf("%d", &q->cheie);
printf("Introduceti informatia: ");
fflush(stdin);
scanf("%s",q->info);
q->urm = NULL;
p=q;
}
//Inserarea unui nod in fata
void ins_cf(void)
{
q = (ref)malloc(sizeof(Tnod));
printg("Introduceti cheia: ");
scanf("%d", &q->cheie);
printf("Introduceti informatia: ");
fflush(stdin);
scanf("%s", q->info);
q->urm=p;
p = q;
}
//Inserarea unui nod in spate
void ins_cs(void)
{
s = (ref)malloc(sizeof(Tnod));
printf("Introduceti cheia :");
scanf("%d", &s->cheie);
printf("Introduceti informatia: ");
scanf("%s", s->info);
s->urm = NULL;
q->urm = s;
q = s;
}
//Inserarea unui nod intr-un loc oarecare
void ins_d(void)
{
s = (ref)malloc(sizeof(Tnod));
printf("Introduceti cheia: ");
scanf("%d" &s->cheie);
printf("Introcudeti informatia: ");
fflush(stdin);
scanf("%s", s->info);
s->urm = r->urm;
r->urm = s;
}
void ins_i(void)
{
s=(ref)malloc(sizeof(Tnod));
*s = *r;
r->urm = s;
printf("Introduceti cheia: ");
scanf("%d", &r->cheie);
printf("Introduceti informatia: ");
fflush(stdin);
scanf("%s", r->info);
}
void listare(void)
{
r=p;
while(r!=NULL){
printf("Cheia: %d;\tInformatia: %s\n",r->cheie, r->info);
r=r->urm;
}
}
void cautare(void){
int b = 0;
r = p;
while((b==0)&&(r!=NULL))
if(r->cheie == k)
b=1;
else r = r->urm;
}
//Stergerea unui element din lista
void sterge_d(void)
{
int er;
if(r->urm==NULL){
printf("Nu avem ce sterge !\n");
er=1;
}
else{
s=r->urm;
r->urm = s->urm;
free(s);
}
}
//Suprimarea unei liste simplu inlt
void stergere_n(void)
{
if(r->urm==NULL)
if(r==p){
p=NULL;
free(r);
}else{
s=p;
while(s->urm!=r)
s=s->urm;
s->urm = NULL;
free(r);
}
else{
s=r->urm;
*r=*s;
free(s);
}
}
int main()
{
return 0;
}