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

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

@return the largest node, from the specified node, in the
specified mapping
find the most node from a given node .