-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbinary_tree.cpp
More file actions
171 lines (170 loc) · 3.41 KB
/
binary_tree.cpp
File metadata and controls
171 lines (170 loc) · 3.41 KB
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
#include <iostream>
using namespace std;
struct node{
int value;
node *left,*right,*previous,*next;
};
class btree{
public:
btree(){root=NULL;}
~btree(){destroy();}
void destroy();
bool search(int);
void print();
void insert(int);
node *newNode(int);
bool erase(int);
private:
node *start,*last;
node *root;
};
bool btree::erase(int key){
node *current, *target, *previous;
current = root;
target = NULL;
if (current == NULL) return false;
while (1){
if (current->value == key)
target = current;
if (key < current->value){
if (current->left == NULL)
break;
previous = current;
current = current->left;
}else{
if (current->right == NULL)
break;
previous = current;
current = current->right;
}
}
if (target == NULL)
return false;
if (!target->left || !target->right) {
if(target == root) {
root = target->left ? target->left : target->right;
} else {
if(previous->left == target)
previous->left = target->left ? target->left : target->right;
else
previous->right = target->left ? target->left : target->right;
}
if (start == target) {
start = start->next;
start->previous = NULL;
}
else if(last == target){
last = last->previous;
last->next=NULL;
}else{
target->previous->next=target->next;
target->next->previous=target->previous;
}
delete target;
}else{
swap(current->value, target->value);
if(previous->right == current) previous->right = current->right;
else previous->left = current->right;
delete current;
}
return true;
}
void btree::destroy(){
node *current=start;
node *target;
while(current){
target=current;
current=current->next;
delete target;
}
}
node* btree::newNode(int key){
node *leaf=new node;
leaf->value=key;
leaf->left=NULL;
leaf->right=NULL;
leaf->next=NULL;
leaf->previous=NULL;
}
void btree::insert(int key){
node *leaf,*father;
bool lado;
leaf = root;
if(leaf==NULL){
root=newNode(key);
start=root;
return;
}
while(leaf!=NULL){
if(leaf->value==key)return;
father=leaf;
if(key<leaf->value){
leaf=leaf->left;
lado=false;
}
else{
leaf=leaf->right;
lado = true;
}
}
leaf=newNode(key);
if(lado){
father->right=leaf;
leaf->previous=father;
leaf->next=father->next;
if(leaf->next)leaf->next->previous=leaf;
else last=leaf;
father->next=leaf;
}
else{
father->left=leaf;
leaf->previous=father->previous;
leaf->next=father;
if(leaf->previous)father->previous->next=leaf;
else start = leaf;
father->previous=leaf;
}
}
bool btree::search(int key) {
node *n = root;
node *father = NULL;
while (n)
if( n->value < key ){
father = n;
n = n->right;
}
else if( n->value > key ){
father = n; n = n->left;
}
else return true;
return NULL;
}
void btree::print() {
node *current=start;
while(current){
cout<<current->value<<" ";
current=current->next;
}
}
int main(){
btree * a= new btree;
a->insert(8);
a->insert(3);
a->insert(1);
a->insert(6);
a->insert(4);
a->insert(7);
a->insert(10);
a->insert(14);
a->insert(13);
a->print();
cout<<endl;
a->erase(1);
a->print();
cout<<endl;
cout<<endl;
a->erase(10);
cout<<endl;
a->print();
return 0;
}