-
Notifications
You must be signed in to change notification settings - Fork 0
/
redblacktree2.c
151 lines (137 loc) · 4.53 KB
/
redblacktree2.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
#include <stdio.h>
#include <stdlib.h>
#define RED 0
#define BLACK 1
struct TreeNode {
int data;
int color; // 0 for red, 1 for black
struct TreeNode* parent;
struct TreeNode* left;
struct TreeNode* right;
};
struct TreeNode* root = NULL;
struct TreeNode* createNode(int value) {
struct TreeNode* newNode = (struct TreeNode*)malloc(sizeof(struct TreeNode));
newNode->data = value;
newNode->color = RED; // New node is always red
newNode->parent = NULL;
newNode->left = NULL;
newNode->right = NULL;
return newNode;
}
void leftRotate(struct TreeNode* currentNode) {
struct TreeNode* rightChild = currentNode->right;
currentNode->right = rightChild->left;
if (rightChild->left != NULL)
rightChild->left->parent = currentNode;
rightChild->parent = currentNode->parent;
if (currentNode->parent == NULL)
root = rightChild;
else if (currentNode == currentNode->parent->left)
currentNode->parent->left = rightChild;
else
currentNode->parent->right = rightChild;
rightChild->left = currentNode;
currentNode->parent = rightChild;
}
void rightRotate(struct TreeNode* currentNode) {
struct TreeNode* leftChild = currentNode->left;
currentNode->left = leftChild->right;
if (leftChild->right != NULL)
leftChild->right->parent = currentNode;
leftChild->parent = currentNode->parent;
if (currentNode->parent == NULL)
root = leftChild;
else if (currentNode == currentNode->parent->left)
currentNode->parent->left = leftChild;
else
currentNode->parent->right = leftChild;
leftChild->right = currentNode;
currentNode->parent = leftChild;
}
void fixInsert(struct TreeNode* newNode) {
while (newNode != NULL && newNode->parent != NULL && newNode->parent->color == RED) {
if (newNode->parent == newNode->parent->parent->left) {
struct TreeNode* uncle = newNode->parent->parent->right;
if (uncle != NULL && uncle->color == RED) {
newNode->parent->color = BLACK;
uncle->color = BLACK;
newNode->parent->parent->color = RED;
newNode = newNode->parent->parent;
} else {
if (newNode == newNode->parent->right) {
newNode = newNode->parent;
leftRotate(newNode);
}
newNode->parent->color = BLACK;
newNode->parent->parent->color = RED;
rightRotate(newNode->parent->parent);
}
} else {
struct TreeNode* uncle = newNode->parent->parent->left;
if (uncle != NULL && uncle->color == RED) {
newNode->parent->color = BLACK;
uncle->color = BLACK;
newNode->parent->parent->color = RED;
newNode = newNode->parent->parent;
} else {
if (newNode == newNode->parent->left) {
newNode = newNode->parent;
rightRotate(newNode);
}
newNode->parent->color = BLACK;
newNode->parent->parent->color = RED;
leftRotate(newNode->parent->parent);
}
}
}
root->color = BLACK;
}
void insert(int value) {
struct TreeNode* newNode = createNode(value);
struct TreeNode* parentNode = NULL;
struct TreeNode* currentNode = root;
while (currentNode != NULL) {
parentNode = currentNode;
if (newNode->data < currentNode->data)
currentNode = currentNode->left;
else
currentNode = currentNode->right;
}
newNode->parent = parentNode;
if (parentNode == NULL)
root = newNode;
else if (newNode->data < parentNode->data)
parentNode->left = newNode;
else
parentNode->right = newNode;
fixInsert(newNode);
}
void inOrder(struct TreeNode* node) {
if (node != NULL) {
inOrder(node->left);
printf("(%d, %s) ", node->data, (node->color == RED) ? "RED" : "BLACK");
inOrder(node->right);
}
}
int main() {
int op;
while(op!=3){
printf("1.Insert\n2.Display\n3.Exit\nEnter your operation:");
scanf("%d",&op);
if(op==1){
int num;
printf("Enter the element to insert:");
scanf("%d",&num);
insert(num);
}
else if(op==2){
printf("In-order Traversal of Red-Black Tree: ");
inOrder(root);
}
else if(op==3){
break;
}
}
return 0;
}