-
Notifications
You must be signed in to change notification settings - Fork 0
/
binary-tree.js
116 lines (106 loc) · 3.13 KB
/
binary-tree.js
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
'use strict';
class BinaryTree {
constructor() {
this.root = null;
}
insert(data) {
if (!this.root) {
this.root = new Node(data);
return true;
}
var parent = this.searchNode(this.root, data);
if (data > parent.data) {
parent.right = new Node(data);
} else {
parent.left = new Node(data);
}
return true;
}
contains(data) {
var res = this.searchNode(this.root, data);
return !res;
}
remove(data) {
if (data === undefined) {
return false;
}
var current = this.root;
var parent = current;
while (current) {
if (data < current.data) {
parent = current;
current = current.left;
} else if (data > current.data) {
parent = current;
current = current.right;
} else {
if (!current.left && !current.right) { // no child case
if (data > parent.data) {
parent.right = null;
} else if (data < parent.data) {
parent.left = null;
} else {
this.root = null;
}
} else if (current.left && current.right) { // two children case
parent = current;
current = current.right;
var min, parentMin;
while (current) {
parentMin = min;
min = current;
current = current.left;
}
parent.data = min.data;
if (parentMin === undefined) {
parent.right = null;
} else {
parentMin.left = min.right || null;
}
} else { // one child case
var child = current.left || current.right;
if (data > parent.data) {
parent.right = child;
} else {
parent.left = child;
}
}
return true;
}
}
return false;
}
size() {
if (!this.root) {
return 0;
} else {
return this.calculateSize(this.root);
}
}
isEmpty() {
if (!this.root)
return true;
else
return false;
}
calculateSize(node) {
if (!node) {
return 0;
}
return (this.calculateSize(node.left) + this.calculateSize(node.right) + 1);
}
searchNode(current, data) {
var parent;
while (current) {
parent = current;
if (data < current.data) {
current = current.left;
} else if (data > current.data) {
current = current.right;
} else {
return false;
}
}
return parent;
}
}