private final boolean checkUnderflowWithLeft(final int slot) {
		final Node<K, V> nodeRight = tree.getNode(childs[slot]);
		if (nodeRight.isUnderFlow()) {
			final Node<K, V> nodeLeft = tree.getNode(childs[slot - 1]);
			if (nodeLeft.canMerge(nodeRight)) {
				nodeLeft.merge(this, slot - 1, nodeRight);
			} else {
				nodeRight.shiftLR(this, slot - 1, nodeLeft);
			}
			//
			// Update Changed Nodes
			tree.putNode(this);
			tree.putNode(nodeLeft);
			tree.putNode(nodeRight);
			return true;
		}
		return false;
	}
private final boolean checkUnderflowWithLeft ( final int slot ) { final Node < K , V > nodeRight = tree . getNode ( childs [ slot ] ) ; if ( nodeRight . isUnderFlow ( ) ) { final Node < K , V > nodeLeft = tree . getNode ( childs [ slot - 1 ] ) ; if ( nodeLeft . canMerge ( nodeRight ) ) { nodeLeft . merge ( this , slot - 1 , nodeRight ) ; } else { nodeRight . shiftLR ( this , slot - 1 , nodeLeft ) ; } tree . putNode ( this ) ; tree . putNode ( nodeLeft ) ; tree . putNode ( nodeRight ) ; return true ; } return false ; }
Check if underflow occurred in child of slot

@param slot the index of a child in nodeParent