src/main/java/com/workplacesystems/utilsj/collections/TransactionalBidiTreeMap.java
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;
    }
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;
    }
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 ...

@param node the node from which we will start searching
@param index KEY or VALUE

@return the smallest node, from the specified node, in the
specified mapping
find the least node from a given node . very useful for starting a sorting iterator ...