-
Notifications
You must be signed in to change notification settings - Fork 0
/
rotateTree.c
91 lines (71 loc) · 1.55 KB
/
rotateTree.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
#include <stdio.h>
#include <stdlib.h>
typedef struct node {
struct node *l, *r;
int data;
} node;
void paintTree(node *root, int deep, const char *prefix)
{
if (root == NULL)
return;
for (int i = 0; i < deep; ++i)
printf(i == deep - 1 ? prefix : " ");
printf("%d\n", root->data);
paintTree(root->l, deep + 1, "-L ");
paintTree(root->r, deep + 1, "-R ");
}
node *newNode(int data, node *l, node *r)
{
node *result = (node *) malloc(sizeof(node));
result->data = data;
result->l = l;
result->r = r;
return result;
}
void cutTree(node *root)
{
if (root == NULL)
return;
cutTree(root->l);
cutTree(root->r);
free(root);
}
node *rotateLeft(node *root)
{
if (root->r == NULL) {
printf("What the NULL\n");
return root;
}
node *result = root->r;
root->r = result->l;
result->l = root;
return result;
}
node *rotateRight(node *root)
{
if (root->l == NULL) {
printf("What the NULL\n");
return root;
}
node *result = root->l;
root->l = result->r;
result->r = root;
return result;
}
int main()
{
node *tree = NULL;
for (int i = 0; i < 10; ++i)
tree = newNode(i , NULL, tree);
paintTree(tree, 0, "");
printf("rotateLeft\n");
for (int i = 0; i < 5; ++i)
tree = rotateLeft(tree);
paintTree(tree, 0, "");
printf("rotateRight\n");
for (int i = 0; i < 2; ++i)
tree->l = rotateRight(tree->l);
paintTree(tree, 0, "");
cutTree(tree);
return 0;
}