private Node < K , V > mostNode ( final Node < K , V > node , final int index ) { Node < K , V > rval = node ; if ( rval != null ) { while ( rval . getRight ( index ) != null ) { rval = rval . getRight ( index ) ; } } return rval ; }
find the most node from a given node .