/**
* Gets the next node in the list after this one.
*
* @return the next node
*/
internal AVLNode next()
{
if (rightIsNext || right == null)
{
return(right);
}
return(right.min());
}
/**
* Gets the leftmost child of this node.
*
* @return the leftmost child (smallest index)
*/
private AVLNode min()
{
return((getLeftSubTree() == null) ? this : left.min());
}