code: protected boolean removeIterative(final K key) {
  		final LeafNode<K, V> nodeLeaf = findLeafNode(key, true);
  		//
  		// Find in leaf node for key and delete it
  		final int slot = nodeLeaf.findSlotByKey(key);
  		if (slot >= 0) { // found
  			// Remove Key
  			nodeLeaf.remove(slot);
  			putNode(nodeLeaf);
  			// Iterate back over nodes checking underflow
  			while (!stackNodes.isEmpty()) {
  				final InternalNode<K, V> node = stackNodes.pop();
  				final int slotcheck = stackSlots.pop();
  				if (!node.checkUnderflow(slotcheck)) {
  					return true;
  				}
  			}
  			return true;
  		}
  		return false;
  	}
docs: Remove the Key from the tree (this function is iterative)
  
  @param key to delete
  @return true if key was removed and false otherwise