-
Notifications
You must be signed in to change notification settings - Fork 0
/
TreeImplementation.cpp
184 lines (157 loc) · 3.8 KB
/
TreeImplementation.cpp
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
182
#include <bits/stdc++.h>
using namespace std;
struct node{
int data;
struct node *left;
struct node *right;
};
struct node *tree;
struct node *create(int val){
struct node *newt = new node();
newt->data = val;
newt->left = NULL;
newt->right = NULL;
return newt;
}
struct node *insert(struct node * tree, int val){
if(tree == NULL){
return create(val);
}else{
if(val < tree->data){
tree->left = insert(tree->left, val);
}else{
tree->right = insert(tree->right, val);
}
}
return tree;
}
struct node *deleteitem(struct node *tree, int val){
if(tree == NULL){
return tree;
}else if(val < tree->data){
deleteitem(tree->left, val);
}else if(val > tree->data){
deleteitem(tree->right, val);
}else{
//Case 1:
if(tree->left == NULL && tree->right == NULL){
delete tree;
tree = NULL;
}
//Case 2
else if(tree->left == NULL){
struct node *temp = tree;
tree = tree->right;
delete temp;
}else if(tree->right == NULL){
struct node *temp = tree;
tree = tree->left;
delete temp;
}
//Case 3
else{
struct node *temp = findmin(tree->right);
tree->data = temp->data;
tree->right = deleteitem(tree->right, temp->data);
}
}
return tree;
}
struct node *findmin(struct node *tree){
while(tree->left != NULL){
tree = tree->left;
}
return tree;
}
void inorder(struct node *tree){
if(tree != NULL){
inorder(tree->left);
cout<<tree->data<<" ";
inorder(tree->right);
}
}
void preorder(struct node *tree){
if(tree != NULL){
cout<<tree->data<<" ";
inorder(tree->left);
inorder(tree->right);
}
}
void postorder(struct node *tree){
if(tree != NULL){
inorder(tree->left);
inorder(tree->right);
cout<<tree->data<<" ";
}
}
int countnodes(struct node *tree){
if(tree == NULL)
return 0;
else{
return(countnodes(tree->left) + countnodes(tree->right) + 1);
}
}
int countExternalNodes(struct node *tree){
if(tree == NULL){
return 0;
}else if(tree->left == NULL && tree->right == NULL){
return 1;
}else{
return(countExternalNodes(tree->left) + countExternalNodes(tree->right));
}
}
int countInternalNodes(struct node *tree){
if((tree->left == NULL && tree->right == NULL) || (tree == NULL)){
return 0;
}else{
return(countInternalNodes(tree->left) + countInternalNodes(tree->right));
}
}
int heightOfTree(struct node *tree){
int lh, rh;
if(tree == NULL){
return 0;
}else{
lh = heightOfTree(tree->left);
rh = heightOfTree(tree->right);
if(lh > rh){
return (lh + 1);
}else{
return (rh + 1);
}
}
}
struct node *mirrorImage(struct node *tree){
struct node *ptr;
if(tree != NULL){
mirrorImage(tree->left);
mirrorImage(tree->right);
ptr = tree->left;
ptr->left = ptr->right;
ptr->right = ptr;
}
}
void deleteTree(struct node *tree){
if(tree != NULL){
deleteTree(tree->left);
deleteTree(tree->right);
delete tree;
}
}
void smallestElement(struct node *tree){
if((tree == NULL) ||(tree->left == NULL)){
cout<<"Smallest Element is: "<<tree->data<<endl;
}else{
smallestElement(tree->left);
}
}
void largestElement(struct node *tree){
if((tree == NULL) || (tree->right == NULL)){
cout<<"Largest Element is: "<<tree->data<<endl;
}else{
largestElement(tree->right);
}
}
int main(){
return 0;
}