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
183
184
185
| // 136_alg_10_lab_17_var_double_num.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <Windows.h>
struct Nodes
{
double num;
struct Nodes *left;
struct Nodes *right;
};
typedef struct Nodes elem;
void ShowTree(elem *tree)
{
if (tree == NULL)
return;
printf("\n\n\n");
printf("Голова: число = %lf ", tree->num);
if (tree->right != NULL)
printf("\nузел справа: число = %lf ", tree->right->num);
if (tree->left != NULL)
printf("\nузел слева число = %lf", tree->left->num);
if (tree->right != NULL)
ShowTree(tree->right);
if (tree->left != NULL)
ShowTree(tree->left);
}
void deleteTree(elem *root,elem *Ptr, double value)
{
elem *parent = NULL;
elem *removed = NULL;
while(Ptr != NULL && Ptr -> num!= value)
{
parent = Ptr;
if(Ptr -> num > value)
Ptr = Ptr -> left;
else
Ptr = Ptr -> right;
}
int peremen = Ptr -> num;
if(root != NULL)
{
elem *child = NULL;
if(Ptr -> left == NULL || Ptr -> right == NULL)
{
if(Ptr -> left == NULL)
child = Ptr -> right;
else
child = Ptr -> left;
if(root -> num == value)
root = child;
else
{
if(parent -> left == Ptr)
parent -> left = child;
else
parent -> right = child;
}
elem *p1=Ptr;
removed = p1;
}
else //if(Ptr -> left != NULL || Ptr -> right != NULL)
{
elem *mostLeft = Ptr -> right;
while(mostLeft -> left != NULL)
{
parent = mostLeft;
mostLeft = mostLeft -> left;
}
if(root -> num == value){
removed = mostLeft;
if(parent -> left == mostLeft)
parent -> left = NULL;
else
parent -> right = NULL;
root -> num= mostLeft -> num;
}
else
{
removed = mostLeft;
if(Ptr -> left == mostLeft)
Ptr -> left = NULL;
else
Ptr -> right = NULL;
Ptr -> num= mostLeft -> num;
}
}
}
printf("\nremoved %lf",removed->num);
free(removed);
}
void del_Depth(elem *root,elem *Ptr, int depth, int number)
{
if(Ptr)
{
if(number != depth - 1)
{
del_Depth(root,Ptr -> right, depth, number + 1);
}
else
{
if(Ptr -> left)
deleteTree(root,root, Ptr -> left -> num);
if(Ptr -> right)
deleteTree(root,root, Ptr -> right ->num);
}
}
}
int getMaxDepth(elem *Ptr, int depth)
{
if (Ptr == NULL)
return depth;
return max(getMaxDepth(Ptr->left, depth + 1), getMaxDepth(Ptr->right, depth + 1));
}
void del_DepthHelper(elem *root)
{
int depth =getMaxDepth(root, 0); //height(root);
if(depth > 2)
{
del_Depth(root,root -> right, depth, 2);
del_Depth(root,root -> left, depth, 2);
}
else if(depth == 2)
{
if(root -> left)
deleteTree(root,root, root -> left -> num);
if(root -> right)
deleteTree(root,root, root -> right -> num);
}
else if(depth == 1)
{
puts("Листков нет!\n");
}
else{
puts("Дерево пустое!\n");
}
}
int main()
{
SetConsoleCP(1251);
SetConsoleOutputCP(1251);
elem *tree = NULL;
del_DepthHelper(tree) ;
puts("");
return 0;
} |
(
