-
Notifications
You must be signed in to change notification settings - Fork 0
/
binary-tree.js
125 lines (103 loc) · 3.09 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
117
118
119
120
121
122
123
124
125
'use strict';
class BinaryTree {
constructor() {
this.root = null;
}
insert(data) {
var currentNode = this.root, parentNode = null;
while (currentNode != null) {
parentNode = currentNode;
if (data < currentNode.data) {
currentNode = currentNode.left;
} else {
currentNode = currentNode.right;
}
}
var newNode = new Node(data, null, null);
if (parentNode == null) {
this.root = newNode;
} else {
if (data < parentNode.data) {
parentNode.left = newNode;
} else {
parentNode.right = newNode;
}
}
}
contains(data) {
var currentNode = this.root;
while (currentNode != null) {
if (currentNode.data == data) {
return true;
}
if (data < currentNode.data) {
currentNode = currentNode.left;
} else {
currentNode = currentNode.right;
}
}
return false;
}
remove(data) {
var currentNode = this.root, parentNode = null;
while (currentNode != null) {
if (data == currentNode.data) {
break;
}
parentNode = currentNode;
if (data < currentNode.data) {
currentNode = currentNode.left;
} else {
currentNode = currentNode.right;
}
}
if (currentNode == null) {
return;
} else if (parentNode == null) {
this.root = null;
} else if (currentNode.left == null && currentNode.right == null) {
Utils.changeDirectChildNode(parentNode, data, null);
} else if (currentNode.left == null || currentNode.right == null) {
if (currentNode.left == null) {
Utils.changeDirectChildNode(parentNode, data, currentNode.right);
} else {
Utils.changeDirectChildNode(parentNode, data, currentNode.left);
}
} else {
var x = currentNode.right, parentX = currentNode;
while (x.left != null) {
parentX = x;
x = x.left;
}
if (parentX != currentNode) {
parentX.left = x.right;
} else {
parentX.right = x.right;
}
x.left = currentNode.left;
x.right = currentNode.right;
Utils.changeDirectChildNode(parentNode, data, x);
}
}
size() {
return this.treeSize(this.root);
}
isEmpty() {
return this.root == null;
}
treeSize(currentNode) {
if (currentNode == null) {
return 0;
}
return 1 + this.treeSize(currentNode.left) + this.treeSize(currentNode.right);
}
}
class Utils {
static changeDirectChildNode(parentNode, data, changeNode) {
if (data < parentNode.data) {
parentNode.left = changeNode;
} else {
parentNode.right = changeNode;
}
}
}