-
Notifications
You must be signed in to change notification settings - Fork 2
/
tree.c
134 lines (125 loc) · 3.12 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
/*
* tree.c
*
* Created by Yigit Colakoglu on 07/06/2021.
* Copyright yigit@yigitcolakoglu.com. 2021. All rights reserved.
*/
#include "tree.h"
#include "linkedlist.h"
#include "urlparse.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
extern TreeNode *root;
TreeNode *addtree(TreeNode *parent, TreeNode *p) {
if (parent == NULL)
return p;
int strdiff = strcmp(parent->path, p->path);
if (!strdiff) {
while (p->params != NULL) {
if (p->params == NULL ||
linkedlistfind(parent->params, p->params->data) == -1) {
p->params = linkedlistadd(parent->params, p->params->data);
}
p->params = p->params->next;
}
} else if (strdiff < 0) {
parent->left = addtree(parent->left, p);
parent->left->parent = parent;
} else {
parent->right = addtree(parent->right, p);
parent->right->parent = parent;
}
return parent;
}
void rotatetreeleft(TreeNode *p) {
TreeNode *r = p->right;
p->right = r->left;
if (p->right)
p->right->parent = p;
r->parent = p->parent;
if (p->parent == NULL)
root = r;
else if (p->parent->left == p)
p->parent->left = r;
else
p->parent->right = r;
r->left = p;
p->parent = r;
}
void rotatetreeright(TreeNode *p) {
TreeNode *l = p->left;
p->left = l->right;
if (p->left)
p->left->parent = p;
l->parent = p->parent;
if (p->parent == NULL)
root = l;
else if (p->parent->left == p)
p->parent->left = l;
else
p->parent->right = l;
l->right = p;
p->parent = l;
}
void balancetree(TreeNode *root, TreeNode *node) {
TreeNode *p = NULL;
TreeNode *gP = NULL;
while (node->parent != NULL && node->parent->parent != NULL && node->red && node->parent->red ) {
p = node->parent;
gP = node->parent->parent;
if (gP->left == p) {
if (gP->right != NULL && gP->right->red) {
gP->red = 1;
gP->left->red = 0;
gP->right->red = 0;
node = gP;
}else{
if(p->right == node){
rotatetreeleft(p);
node = p;
p = node->parent;
}else{
rotatetreeright(gP);
int c = p->red;
p->red = gP->red;
gP->red = c;
node = p;
}
}
} else {
if(gP->left != NULL && gP->left->red){
gP->red = 1;
gP->left->red = 0;
gP->right->red = 0;
node = gP;
}else{
if(p->left == node){
rotatetreeright(p);
node = p;
p = node->parent;
}else{
rotatetreeleft(gP);
int c = p->red;
p->red = gP->red;
gP->red = c;
node = p;
}
}
}
}
root->red = 0;
}
TreeNode *treealloc(void) { return (TreeNode *)malloc(sizeof(TreeNode)); }
void printtree(TreeNode *root, FILE *out, char *payload, int minparams) {
if (root != NULL) {
printtree(root->left, out, payload, minparams);
if(root->nparams >= minparams){
fprintf(out, "%s", root->path);
(!root->nparams) ? : fprintf(out, "%c",'?');
linkedlistprint(root->params, out, payload);
fprintf(out, "%c", '\n');
}
printtree(root->right, out, payload, minparams);
}
}