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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
| #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef int T;
#define CMP_EQ(a, b) ((a) == (b))
#define CMP_LT(a, b) ((a) < (b))
#define CMP_GT(a, b) ((a) > (b))
typedef struct Node {
T data;
struct Node *left;
struct Node *right;
struct Node *parent;
} Node;
Node* getFreeNode(T value, Node *parent) {
Node* tmp = (Node*)malloc(sizeof(Node));
tmp->left = tmp->right = NULL;
tmp->data = value;
tmp->parent = parent;
return tmp;
}
void insert(Node **head, int value) {
Node *tmp = NULL;
Node *ins = NULL;
if (*head == NULL) {
*head = getFreeNode(value, NULL);
return;
}
tmp = *head;
while (tmp) {
if (CMP_GT(value, tmp->data)) {
if (tmp->right) {
tmp = tmp->right;
continue;
}
else {
tmp->right = getFreeNode(value, tmp);
return;
}
}
else if (CMP_LT(value, tmp->data)) {
if (tmp->left) {
tmp = tmp->left;
continue;
}
else {
tmp->left = getFreeNode(value, tmp);
return;
}
}
else {
exit(2);
}
}
}
Node* findMinNode(Node *root) {
while (root->left) {
root = root->left;
}
return root;
}
Node* findMaxNode(Node *root) {
while (root->right) {
root = root->right;
}
return root;
}
Node *getNodeByValue(Node *root, T value) {
while (root) {
if (CMP_GT(root->data, value)) {
root = root->left;
continue;
}
else if (CMP_LT(root->data, value)) {
root = root->right;
continue;
}
else {
return "TRUE";
}
}
return "FALSE";
}
void removeNodeByPtr(Node *target) {
if (target->left && target->right) {
Node *localMax = findMaxNode(target->left);
target->data = localMax->data;
removeNodeByPtr(localMax);
return;
}
else if (target->left) {
if (target == target->parent->left) {
target->parent->left = target->left;
}
else {
target->parent->right = target->left;
}
}
else if (target->right) {
if (target == target->parent->right) {
target->parent->right = target->right;
}
else {
target->parent->left = target->right;
}
}
else {
if (target == target->parent->left) {
target->parent->left = NULL;
}
else {
target->parent->right = NULL;
}
}
free(target);
}
void deleteValue(Node *root, T value) {
Node *target = getNodeByValue(root, value);
removeNodeByPtr(target);
}
void printTree(Node *root, const char *dir, int level) {
if (root) {
printf("lvl %d %s = %d\n", level, dir, root->data);
printTree(root->left, "left", level + 1);
printTree(root->right, "right", level + 1);
}
}
void main() {
Node *root = NULL;
char str[10];
int c;
FILE *f;
f = fopen("sort.txt", "r");
FILE *f2;
f2 = fopen("sort2.txt", "w");
for (int i = 0; i <= 5; i++)
{
fgets(str, 10, f);
fscanf("%d", &c);
if (strcmp(str, "insert") == 0)
{
insert(&root, c);
}
else if (strcmp(str, "delete") == 0)
{
deleteValue(root, c);
}
else if (strcmp(str, "exists") == 0)
{
fprintf(f2, "%s ", getNodeByValue(root, c));
}
else printf("ERROR");
}
/*insert(&root, 10);
insert(&root, 12);
insert(&root, 8);
insert(&root, 9);
insert(&root, 7);
insert(&root, 3);
insert(&root, 4);
printTree(root, "root", 0);
printf("max = %d\n", findMaxNode(root)->data);
printf("min = %d\n", findMinNode(root)->data);
deleteValue(root, 4);
printf("parent of 7 is %d\n", getNodeByValue(root, 7)->parent->data);
printTree(root, "root", 0);
deleteValue(root, 8);
printTree(root, "root", 0);
printf("------------------\n");
deleteValue(root, 10);
printTree(root, "root", 0);*/
system("pause");
return 0;
} |
(
