private Node<K, V> prevNodeAll( Node<K, V> node ) {
        if( node.mAllLeft != null ) {
            node = node.mAllLeft;

            while( node.mAllRight != null ) { node = node.mAllRight; }

        } else {
            while( node.mAllParent != null && node.mAllParent.mAllLeft == node ) { node = node.mAllParent; }

            node = node.mAllParent;
        }

        return node;
    }