/**
* Gets the node in the list before this one.
*
* @return the previous node
*/
internal AVLNode previous()
{
if (leftIsPrevious || left == null)
{
return(left);
}
return(left.max());
}
/**
* Gets the rightmost child of this node.
*
* @return the rightmost child (greatest index)
*/
private AVLNode max()
{
return((getRightSubTree() == null) ? this : right.max());
}