/
treesSimple.c
163 lines (135 loc) · 2.93 KB
/
treesSimple.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
163
# include <stdio.h>
# include <stdlib.h>
struct treeNode{
int data;
struct treeNode * left;
struct treeNode * right;
};
struct treeNode * Insert(struct treeNode *node, int data){
if(node==NULL)
{
struct treeNode *temp;
temp = (struct treeNode *)malloc(sizeof(struct treeNode));
temp -> data = data;
temp -> left = temp -> right = NULL;
return temp;
}
if(data >(node->data))
{
node->right = Insert(node->right,data);
}
else if(data < (node->data))
{
node->left = Insert(node->left,data);
}
return node;
}
void printInorder(struct treeNode* root){
if(root == NULL){
return;
}
printInorder(root->left);
printf(" %d ", root->data);
printInorder(root->right);
}
void printPreorder(struct treeNode* root){
if(root == NULL){
return;
}
printf(" %d ", root->data);
printPreorder(root->left);
printPreorder(root->right);
}
void printPostorder(struct treeNode* root){
if(root == NULL){
return;
}
printPostorder(root->left);
printPostorder(root->right);
printf(" %d ", root->data);
}
// int findMax(struct treeNode * root){
// int maxTree = 0;
// maxTree = root->data;
// while(root->right != NULL){
// root=root->right;
// if(root->data>maxTree){
// maxTree = root->data;
// }
// }
// return maxTree;
// }
struct treeNode* FindMin(struct treeNode *node)
{
if(node==NULL)
{
return NULL;
}
if(node->left)
return FindMin(node->left);
else
return node;
}
struct treeNode* FindMax(struct treeNode* node){
if(node == NULL)
return NULL;
if(node->right)
return FindMax(node->right);
else
return node;
}
struct treeNode* deleteNode(struct treeNode * root, int number){
if(root==NULL){
printf("Element not found\n");
}
if(number > root->data){
root->right = deleteNode(root->right, number);
}
else if(number < root->data){
root->left = deleteNode(root->left, number);
}
else{
if((root->left != NULL)&&(root->right != NULL)){
struct treeNode* temp = FindMin(root->right);
root->data = temp->data;
root->right = deleteNode(root->right, temp->data);
}
else{
struct treeNode* temp = root;
if(root->left==NULL)
root=root->right;
else if(root->right == NULL)
root = root->left;
}
}
return root;
}
int searchNode(struct treeNode* root, int number){
if(root==NULL){
return 0;
}
if(number > root->data){
return searchNode(root->right, number);
}
else if(number < root->data){
return searchNode(root->left, number);
}
else{
return 1;
}
}
int main(){
struct treeNode * root = NULL;
root = Insert(root, 5);
root = Insert(root, 2);
root = Insert(root, -4);
root = Insert(root, 19);
root = Insert(root, 21);
root = Insert(root, 9);
root = Insert(root, 25);
root = Insert(root, 6);
printInorder(root);
deleteNode(root, 2);
printf("\n\n\n\n");
printInorder(root);
}