private Node < K , V > leastNode ( final Node < K , V > node , final int index ) { Node < K , V > lval = node ; if ( lval != null ) { while ( lval . getLeft ( index ) != null ) { lval = lval . getLeft ( index ) ; } } return lval ; }
find the least node from a given node . very useful for starting a sorting iterator ...