/
tree.c
163 lines (130 loc) · 3 KB
/
tree.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
158
159
160
161
162
#include <stdio.h>
#include <stdlib.h>
typedef struct node{
int data;
struct node * left;
struct node * right;
} Node;
Node * novoNode(int data){
Node * aux = malloc(sizeof(Node));
aux->data = data;
aux->left = NULL;
aux->right = NULL;
return aux;
}
Node * insertTree(Node * a, int data);
Node * insertTree(Node * a, int data){
if (a == NULL){
a = malloc(sizeof(Node));
a->data = data;
a->left = NULL;
a->right = NULL;
} else {
if (data < a->data){
a->left = insertTree(a->left, data);
} else {
a->right = insertTree(a->right, data);
}
}
return a;
}
void imprimeArv(Node * a){
if (a != NULL){
imprimeArv(a->left);
printf("%d ", a->data);
imprimeArv(a->right);
}
}
Node * maxAt(Node * a){
if (a != NULL){
if (a->right != NULL)
return maxAt(a->right);
else
return a;
}
return a;
}
Node * minAt(Node * a){
if (a != NULL){
if (a->left != NULL)
return maxAt(a->left);
else
return a;
}
return a;
}
Node *searchInOrder(Node * tree, int data){
if (tree == NULL){
return NULL;
} else if (data < tree->data){
return searchInOrder(tree->left, data);
} else if (tree->data == data){
return tree;
} else {
return searchInOrder(tree->right, data);
}
}
Node * removeNode(Node * raiz, int data){
if (raiz != NULL){
//se está na direita
if (data > (raiz)->data){
(raiz->right) = removeNode((raiz)->right, data);
} else if (data < (raiz)->data){
(raiz->left) = removeNode((raiz)->left, data);
} else {
if (raiz->left == NULL && raiz->right == NULL){
free(raiz);
raiz = NULL;
} else {
Node * aux;
if (raiz->left == NULL) { //se ele só tem filhos na direita
aux = raiz;
raiz = raiz->right;
free(aux);
} else if (raiz->right == NULL) { //se ele só tem filhos na esquerda
aux = raiz;
raiz = raiz->left;
free(aux);
} else { //se tem filhos nos 2 lados
Node * aux = malloc(sizeof(Node));
aux = raiz->left;
while (aux->right != NULL) {
aux = aux->right;
}
raiz->data = aux->data;
aux->data = data;
raiz->left = removeNode(raiz->left, data);
}
}
}
}
return raiz;
}
int main(){
/*
Node * raiz = novoNode(4);
raiz = insertTree(raiz, 2);
raiz = insertTree(raiz, 6);
raiz = insertTree(raiz, 1);
raiz = insertTree(raiz, 3);
raiz = insertTree(raiz, 5);
raiz = insertTree(raiz, 7);
raiz = insertTree(raiz, 8);
raiz = insertTree(raiz, 10);
raiz = insertTree(raiz, 9);
*/
Node * raiz = novoNode(2);
raiz = insertTree(raiz, 1);
raiz = insertTree(raiz, 3);
raiz = insertTree(raiz, 8);
raiz = insertTree(raiz, 10);
raiz = insertTree(raiz, 9);
imprimeArv(raiz);
printf("\n");
Node * achar = searchInOrder(raiz, 1);
printf("%d\n", achar->data);
raiz = removeNode(raiz, 10);
imprimeArv(raiz);
printf("\n");
return 0;
}