FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
javascript-algorithms/src/data-structures/tree/BinaryTreeNode.js at master · 157/javascript-algorithms · GitHub
157
/
javascript-algorithms
Public
forked from
trekhleb/javascript-algorithms
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
javascript-algorithms
/
src
/
data-structures
/
tree
/
BinaryTreeNode.js
Copy path
More file actions
More file actions
Latest commit
History
History
History
219 lines (181 loc) · 4.4 KB
Breadcrumbs
javascript-algorithms
/
src
/
data-structures
/
tree
/
BinaryTreeNode.js
Copy path
File metadata and controls
219 lines (181 loc) · 4.4 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
import
Comparator
from
'../../utils/comparator/Comparator'
;
import
HashTable
from
'../hash-table/HashTable'
;
export
default
class
BinaryTreeNode
{
/**
*
@param
{
*
} [value] - node value.
*/
constructor
(
value
=
null
)
{
this
.
left
=
null
;
this
.
right
=
null
;
this
.
parent
=
null
;
this
.
value
=
value
;
// Any node related meta information may be stored here.
this
.
meta
=
new
HashTable
(
)
;
// This comparator is used to compare binary tree nodes with each other.
this
.
nodeComparator
=
new
Comparator
(
)
;
}
/**
*
@return
{
number
}
*/
get
leftHeight
(
)
{
if
(
!
this
.
left
)
{
return
0
;
}
return
this
.
left
.
height
+
1
;
}
/**
*
@return
{
number
}
*/
get
rightHeight
(
)
{
if
(
!
this
.
right
)
{
return
0
;
}
return
this
.
right
.
height
+
1
;
}
/**
*
@return
{
number
}
*/
get
height
(
)
{
return
Math
.
max
(
this
.
leftHeight
,
this
.
rightHeight
)
;
}
/**
*
@return
{
number
}
*/
get
balanceFactor
(
)
{
return
this
.
leftHeight
-
this
.
rightHeight
;
}
/**
* Get parent's sibling if it exists.
*
@return
{
BinaryTreeNode
}
*/
get
uncle
(
)
{
// Check if current node has parent.
if
(
!
this
.
parent
)
{
return
undefined
;
}
// Check if current node has grand-parent.
if
(
!
this
.
parent
.
parent
)
{
return
undefined
;
}
// Check if grand-parent has two children.
if
(
!
this
.
parent
.
parent
.
left
||
!
this
.
parent
.
parent
.
right
)
{
return
undefined
;
}
// So for now we know that current node has grand-parent and this
// grand-parent has two children. Let's find out who is the uncle.
if
(
this
.
nodeComparator
.
equal
(
this
.
parent
,
this
.
parent
.
parent
.
left
)
)
{
// Right one is an uncle.
return
this
.
parent
.
parent
.
right
;
}
// Left one is an uncle.
return
this
.
parent
.
parent
.
left
;
}
/**
*
@param
{
*
} value
*
@return
{
BinaryTreeNode
}
*/
setValue
(
value
)
{
this
.
value
=
value
;
return
this
;
}
/**
*
@param
{
BinaryTreeNode
} node
*
@return
{
BinaryTreeNode
}
*/
setLeft
(
node
)
{
// Reset parent for left node since it is going to be detached.
if
(
this
.
left
)
{
this
.
left
.
parent
=
null
;
}
// Attach new node to the left.
this
.
left
=
node
;
// Make current node to be a parent for new left one.
if
(
this
.
left
)
{
this
.
left
.
parent
=
this
;
}
return
this
;
}
/**
*
@param
{
BinaryTreeNode
} node
*
@return
{
BinaryTreeNode
}
*/
setRight
(
node
)
{
// Reset parent for right node since it is going to be detached.
if
(
this
.
right
)
{
this
.
right
.
parent
=
null
;
}
// Attach new node to the right.
this
.
right
=
node
;
// Make current node to be a parent for new right one.
if
(
node
)
{
this
.
right
.
parent
=
this
;
}
return
this
;
}
/**
*
@param
{
BinaryTreeNode
} nodeToRemove
*
@return
{
boolean
}
*/
removeChild
(
nodeToRemove
)
{
if
(
this
.
left
&&
this
.
nodeComparator
.
equal
(
this
.
left
,
nodeToRemove
)
)
{
this
.
left
=
null
;
return
true
;
}
if
(
this
.
right
&&
this
.
nodeComparator
.
equal
(
this
.
right
,
nodeToRemove
)
)
{
this
.
right
=
null
;
return
true
;
}
return
false
;
}
/**
*
@param
{
BinaryTreeNode
} nodeToReplace
*
@param
{
BinaryTreeNode
} replacementNode
*
@return
{
boolean
}
*/
replaceChild
(
nodeToReplace
,
replacementNode
)
{
if
(
!
nodeToReplace
||
!
replacementNode
)
{
return
false
;
}
if
(
this
.
left
&&
this
.
nodeComparator
.
equal
(
this
.
left
,
nodeToReplace
)
)
{
this
.
left
=
replacementNode
;
return
true
;
}
if
(
this
.
right
&&
this
.
nodeComparator
.
equal
(
this
.
right
,
nodeToReplace
)
)
{
this
.
right
=
replacementNode
;
return
true
;
}
return
false
;
}
/**
*
@param
{
BinaryTreeNode
} sourceNode
*
@param
{
BinaryTreeNode
} targetNode
*/
static
copyNode
(
sourceNode
,
targetNode
)
{
targetNode
.
setValue
(
sourceNode
.
value
)
;
targetNode
.
setLeft
(
sourceNode
.
left
)
;
targetNode
.
setRight
(
sourceNode
.
right
)
;
}
/**
*
@return
{
*[]
}
*/
traverseInOrder
(
)
{
let
traverse
=
[
]
;
// Add left node.
if
(
this
.
left
)
{
traverse
=
traverse
.
concat
(
this
.
left
.
traverseInOrder
(
)
)
;
}
// Add root.
traverse
.
push
(
this
.
value
)
;
// Add right node.
if
(
this
.
right
)
{
traverse
=
traverse
.
concat
(
this
.
right
.
traverseInOrder
(
)
)
;
}
return
traverse
;
}
/**
*
@return
{
string
}
*/
toString
(
)
{
return
this
.
traverseInOrder
(
)
.
toString
(
)
;
}
}
Back
|
FazBrowse Home
|
New Git URL