Search
Preparing search index...
The search index is not available
tstruct
Options
All
Public
Public/Protected
All
Inherited
Externals
Only exported
Menu
Globals
"BinaryTree/BinaryTree"
BinaryTreeNode
Class BinaryTreeNode<T>
Type parameters
T
Hierarchy
BinaryTreeNode
Implements
IBinaryTreeNode
<
T
>
Index
Constructors
constructor
Properties
left
parent
right
val
Methods
copy
To
height
is
Balanced
parent
Side
Constructors
constructor
new
Binary
Tree
Node
(
value
:
T
, parent
?:
IBinaryTreeNode
<
T
>
, left
?:
IBinaryTreeNode
<
T
>
, right
?:
IBinaryTreeNode
<
T
>
)
:
BinaryTreeNode
Parameters
value:
T
Optional
parent:
IBinaryTreeNode
<
T
>
Optional
left:
IBinaryTreeNode
<
T
>
Optional
right:
IBinaryTreeNode
<
T
>
Returns
BinaryTreeNode
Properties
Optional
left
left
:
IBinaryTreeNode
<
T
>
Optional
parent
parent
:
IBinaryTreeNode
<
T
>
Optional
right
right
:
IBinaryTreeNode
<
T
>
val
val
:
T
Methods
copy
To
copy
To
(
node
?:
IBinaryTreeNode
<
T
>
)
:
void
Parameters
Optional
node:
IBinaryTreeNode
<
T
>
Returns
void
height
height
(
node
?:
IBinaryTreeNode
<
T
>
)
:
number
Parameters
Default value
node:
IBinaryTreeNode
<
T
>
= this
Returns
number
is
Balanced
is
Balanced
(
)
:
boolean
Returns
boolean
parent
Side
parent
Side
(
)
:
"left"
|
"right"
Returns
"left"
|
"right"
Globals
"
Binary
Tree/AVLTree"
"
Binary
Tree/
Binary
Search
Tree"
"
Binary
Tree/
Binary
Tree"
"
Common/
Common"
"
Compare
Function"
"
Graph/
Graph"
"
Heap/
Heap"
"
Linked
List/
Linked
List"
"
Queue/
Priority
Queue"
"
Queue/
Queue"
"
Sorting
Algorithms/
Sorting
Algorithms"
"
Stack/
Stack"
"
Trie/
Trie"
"
Union
Find/
Union
Find"
Binary
Tree
Binary
Tree
Node
constructor
left
parent
right
val
copy
To
height
is
Balanced
parent
Side
IBinary
Tree
IBinary
Tree
Node
Generated using
TypeDoc