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"
BinaryTree
Class BinaryTree<T>
Type parameters
T
Hierarchy
BinaryTree
BinarySearchTree
Implements
IBinaryTree
<
T
>
Index
Properties
_head
Accessors
head
Methods
add
find
Bottom
Node
find
Node
remove
to
Array
value
Exists
Properties
Protected
_head
_head
:
IBinaryTreeNode
<
T
>
Accessors
head
get
head
(
)
:
IBinaryTreeNode
<
T
>
Returns
IBinaryTreeNode
<
T
>
Methods
add
add
(
value
:
T
)
:
void
Parameters
value:
T
Returns
void
Private
find
Bottom
Node
find
Bottom
Node
(
node
:
IBinaryTreeNode
<
T
>
)
:
IBinaryTreeNode
<
T
>
Parameters
node:
IBinaryTreeNode
<
T
>
Returns
IBinaryTreeNode
<
T
>
find
Node
find
Node
(
value
:
T
, node
?:
IBinaryTreeNode
<
T
>
)
:
IBinaryTreeNode
<
T
>
Parameters
value:
T
Default value
node:
IBinaryTreeNode
<
T
>
= this.head
Returns
IBinaryTreeNode
<
T
>
remove
remove
(
value
:
T
)
:
void
Parameters
value:
T
Returns
void
to
Array
to
Array
(
)
:
T
[]
Returns
T
[]
value
Exists
value
Exists
(
value
:
T
)
:
boolean
Parameters
value:
T
Returns
boolean
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
_head
head
add
find
Bottom
Node
find
Node
remove
to
Array
value
Exists
Binary
Tree
Node
IBinary
Tree
IBinary
Tree
Node
Generated using
TypeDoc