utilities-library
Preparing search index...
The search index is not available
utilities-library
AVLTree
Class AVLTree<T>
Clase que representa un arbol m-way tree y proporciona métodos para manipularlo.
Type Parameters
T
Hierarchy (
View Summary
)
BinarySearchTree
<
T
>
AVLTree
Index
Constructors
constructor
Properties
root
Methods
all
Nodes
Have
Two
Children
In
Level
cardinality
count
Left
Children
count
Nodes
In
Level
count
Right
Children
delete
find
Key
find
KeyR
get
Root
has
Key
height
heightR
in
Order
in
OrderR
insert
insertR
is
Empty
level
Order
level
OrderR
max
maxR
min
minR
post
Order
post
OrderR
pre
Order
pre
OrderR
rebuild
Post
Order
In
Order
rebuild
Pre
Order
In
Order
set
Root
size
sizeR
to
String
Constructors
constructor
new
AVLTree
<
T
>
()
:
AVLTree
<
T
>
Type Parameters
T
Returns
AVLTree
<
T
>
Properties
Protected
root
root
:
null
|
BinaryTreeNode
<
T
>
Methods
all
Nodes
Have
Two
Children
In
Level
allNodesHaveTwoChildrenInLevel
(
targetLevel
:
number
)
:
boolean
Parameters
targetLevel
:
number
Returns
boolean
cardinality
cardinality
(
root
:
null
|
BinaryTreeNode
<
T
>
)
:
number
Parameters
root
:
null
|
BinaryTreeNode
<
T
>
Returns
number
count
Left
Children
countLeftChildren
()
:
number
Returns
number
count
Nodes
In
Level
countNodesInLevel
(
targetLevel
:
number
)
:
number
Parameters
targetLevel
:
number
Returns
number
count
Right
Children
countRightChildren
()
:
number
Returns
number
delete
delete
(
keyToDelete
:
number
)
:
this
Parameters
keyToDelete
:
number
Returns
this
find
Key
findKey
(
key
:
number
)
:
null
|
T
Parameters
key
:
number
Returns
null
|
T
find
KeyR
findKeyR
(
keyToSearch
:
number
)
:
null
|
T
Parameters
keyToSearch
:
number
Returns
null
|
T
get
Root
getRoot
()
:
null
|
BinaryTreeNode
<
T
>
Returns
null
|
BinaryTreeNode
<
T
>
has
Key
hasKey
(
key
:
number
)
:
boolean
Parameters
key
:
number
Returns
boolean
height
height
(
root
:
null
|
BinaryTreeNode
<
T
>
)
:
number
Parameters
root
:
null
|
BinaryTreeNode
<
T
>
Returns
number
heightR
heightR
(
root
:
null
|
BinaryTreeNode
<
T
>
)
:
number
Parameters
root
:
null
|
BinaryTreeNode
<
T
>
Returns
number
in
Order
inOrder
()
:
Data
<
T
>
[]
Returns
Data
<
T
>
[]
in
OrderR
inOrderR
()
:
Data
<
T
>
[]
Returns
Data
<
T
>
[]
insert
insert
(
data
:
Data
<
T
>
)
:
AVLTree
<
T
>
Parameters
data
:
Data
<
T
>
Returns
AVLTree
<
T
>
insertR
insertR
(
data
:
Data
<
T
>
)
:
this
Parameters
data
:
Data
<
T
>
Returns
this
is
Empty
isEmpty
()
:
boolean
Returns
boolean
level
Order
levelOrder
()
:
Data
<
T
>
[]
Returns
Data
<
T
>
[]
level
OrderR
levelOrderR
()
:
Data
<
T
>
[]
Returns
Data
<
T
>
[]
max
max
(
root
:
null
|
BinaryTreeNode
<
T
>
)
:
null
|
BinaryTreeNode
<
T
>
Parameters
root
:
null
|
BinaryTreeNode
<
T
>
Returns
null
|
BinaryTreeNode
<
T
>
maxR
maxR
(
root
:
null
|
BinaryTreeNode
<
T
>
)
:
null
|
BinaryTreeNode
<
T
>
Parameters
root
:
null
|
BinaryTreeNode
<
T
>
Returns
null
|
BinaryTreeNode
<
T
>
min
min
(
root
:
null
|
BinaryTreeNode
<
T
>
)
:
null
|
BinaryTreeNode
<
T
>
Parameters
root
:
null
|
BinaryTreeNode
<
T
>
Returns
null
|
BinaryTreeNode
<
T
>
minR
minR
(
root
:
null
|
BinaryTreeNode
<
T
>
)
:
null
|
BinaryTreeNode
<
T
>
Parameters
root
:
null
|
BinaryTreeNode
<
T
>
Returns
null
|
BinaryTreeNode
<
T
>
post
Order
postOrder
()
:
Data
<
T
>
[]
Returns
Data
<
T
>
[]
post
OrderR
postOrderR
()
:
Data
<
T
>
[]
Returns
Data
<
T
>
[]
pre
Order
preOrder
()
:
Data
<
T
>
[]
Returns
Data
<
T
>
[]
pre
OrderR
preOrderR
()
:
Data
<
T
>
[]
Returns
Data
<
T
>
[]
rebuild
Post
Order
In
Order
rebuildPostOrderInOrder
(
paramPostOrderList
:
Data
<
T
>
[]
,
paramInOrderList
:
Data
<
T
>
[]
,
)
:
void
Parameters
paramPostOrderList
:
Data
<
T
>
[]
paramInOrderList
:
Data
<
T
>
[]
Returns
void
rebuild
Pre
Order
In
Order
rebuildPreOrderInOrder
(
paramPreOrderList
:
Data
<
T
>
[]
,
paramInOrderList
:
Data
<
T
>
[]
,
)
:
void
Parameters
paramPreOrderList
:
Data
<
T
>
[]
paramInOrderList
:
Data
<
T
>
[]
Returns
void
set
Root
setRoot
(
newRoot
:
null
|
BinaryTreeNode
<
T
>
)
:
void
Parameters
newRoot
:
null
|
BinaryTreeNode
<
T
>
Returns
void
size
size
(
root
:
null
|
BinaryTreeNode
<
T
>
)
:
number
Parameters
root
:
null
|
BinaryTreeNode
<
T
>
Returns
number
sizeR
sizeR
(
root
:
null
|
BinaryTreeNode
<
T
>
)
:
number
Parameters
root
:
null
|
BinaryTreeNode
<
T
>
Returns
number
to
String
toString
()
:
string
Returns
string
Settings
Member Visibility
Protected
Inherited
External
Theme
OS
Light
Dark
On This Page
Constructors
constructor
Properties
root
Methods
allNodesHaveTwoChildrenInLevel
cardinality
countLeftChildren
countNodesInLevel
countRightChildren
delete
findKey
findKeyR
getRoot
hasKey
height
heightR
inOrder
inOrderR
insert
insertR
isEmpty
levelOrder
levelOrderR
max
maxR
min
minR
postOrder
postOrderR
preOrder
preOrderR
rebuildPostOrderInOrder
rebuildPreOrderInOrder
setRoot
size
sizeR
toString
Modules
AVLTree
BinarySearchTree
Cadena
ListaCircular
ListaDoblementeEnlazada
ListaEnlazada
Matriz
MWayTree
Numero
Queue
Stack
Tensor
Vector
Clase que representa un arbol m-way tree y proporciona métodos para manipularlo.