goog.structs.AvlTree |
opt_comparator
: Function=
Function used to order the tree's nodes.
|
Inserts a node into the tree with the specified value if the tree does
not already contain a node with the specified value. If the value is
inserted, the tree is balanced to enforce the AVL-Tree height property.
Arguments:
Returns: boolean
Whether value was inserted into the tree.
|
code » | ||||
![]()
Ensures that the specified node and all its ancestors are balanced. If they
are not, performs left and right tree rotations to achieve a balanced
tree. This method assumes that at most 2 rotations are necessary to balance
the tree (which is true for AVL-trees that are balanced after each node is
added or removed).
Arguments:
|
code » | ||||
![]()
Removes all nodes from the tree.
|
code » | ||||
Returns true if the tree contains a node with the specified value, false
otherwise.
Arguments:
Returns: boolean
Whether the tree contains a node with the specified value.
|
code » | ||||
Returns the number of values stored in the tree.
Returns: number
The number of values stored in the tree.
|
code » | ||||
Returns the height of the tree (the maximum depth). This height should
always be <= 1.4405*(Math.log(n+2)/Math.log(2))-1.3277, where n is the
number of nodes in the tree.
Returns: number
The height of the tree.
|
code » | ||||
Returns the node in the tree that has k nodes before it in an in-order
traversal, optionally rooted at
opt_rootNode .
Arguments:
Returns: goog.structs.AvlTree.Node.<T>
The node at the specified index.
|
code » | ||||
![]()
Returns a k-th smallest value, based on the comparator, where 0 <= k <
this.getCount().
Arguments:
Returns: T
The k-th smallest value.
|
code » | ||||
Returns the node with the largest value in tree, optionally rooted at
opt_rootNode.
Arguments:
Returns: goog.structs.AvlTree.Node.<T>
The node with the largest value in
the tree.
|
code » | ||||
![]()
Returns the value u, such that u is contained in the tree and u > v, for all
values v in the tree where v != u.
Returns: T
The maximum value contained in the tree.
|
code » | ||||
Returns the node with the smallest value in tree, optionally rooted at
opt_rootNode .
Arguments:
Returns: goog.structs.AvlTree.Node.<T>
The node with the smallest value in
the tree.
|
code » | ||||
![]()
Returns the value u, such that u is contained in the tree and u < v, for all
values v in the tree where v != u.
Returns: T
The minimum value contained in the tree.
|
code » | ||||
Inserts the values stored in the tree into a new Array and returns the Array.
|
code » | ||||
![]()
Performs an in-order traversal of the tree and calls
func with each
traversed node, optionally starting from the smallest node with a value >= to
the specified start value. The traversal ends after traversing the tree's
maximum node or when func returns a value that evaluates to true.
Arguments:
|
code » | ||||
Returns the index (in an in-order traversal) of the node in the tree with
the specified value. For example, the minimum value in the tree will
return an index of 0 and the maximum will return an index of n - 1 (where
n is the number of nodes in the tree). If the value is not found then -1
is returned.
Arguments:
Returns: !number
The in-order index of the given value in the
tree or -1 if the value is not found.
|
code » | ||||
![]()
Performs a left tree rotation on the specified node.
Arguments:
|
code » | ||||
![]()
Removes a node from the tree with the specified value if the tree contains a
node with this value. If a node is removed the tree is balanced to enforce
the AVL-Tree height property. The value of the removed node is returned.
Arguments:
Returns: T
The value of the removed node or null if the value was not in
the tree.
|
code » | ||||
![]()
Removes the specified node from the tree and ensures the tree still
maintains the AVL-tree balance.
Arguments:
|
code » | ||||
![]()
Performs a reverse-order traversal of the tree and calls
func with
each traversed node, optionally starting from the largest node with a value
<= to the specified start value. The traversal ends after traversing the
tree's minimum node or when func returns a value that evaluates to true.
Arguments:
|
code » | ||||
![]()
Performs a right tree rotation on the specified node.
Arguments:
|
code » | ||||
![]()
Performs a traversal defined by the supplied
traversalFunc . The first
call to traversalFunc is passed the root or the optionally specified
startNode. After that, calls traversalFunc with the node returned
by the previous call to traversalFunc until traversalFunc
returns null or the optionally specified endNode. The first call to
traversalFunc is passed the root or the optionally specified startNode.
Arguments:
|
code » |
![]()
Comparison function used to compare values in the tree. This function should
take two values, a and b, and return x where:
x < 0 if a < b, x > 0 if a > b, x = 0 otherwise |
Code » | |
Pointer to the node with the largest value in the tree.
|
Code » | |
Pointer to the node with the smallest value in the tree.
|
Code » | |
Pointer to the root node of the tree.
|
Code » |
String comparison function used to compare values in the tree. This function
is used by default if no comparator is specified in the tree's constructor.
Arguments:
Returns: number
-1 if a < b, 1 if a > b, 0 if a = b.
|
code » |