budget/src/main/java/budget/backend/structures/BinaryTreeHeap.java
public K removeMinK(){
		if (!isEmpty()){
			K ret = root.getKey();
			remove(root);
			return ret;
		}
		return null;
	}
/**
	 * Remove the minimum element from the heap, which is always the root node.
	 * Restore the heap order
	 * 
	 * @return the key of the minimum element
	 * @return null is the tree is empty
	 */
Remove the minimum element from the heap, which is always the root node.
Restore the heap order

@return the key of the minimum element
@return null is the tree is empty
Remove the minimum element from the heap which is always the root node . Restore the heap order @return the key of the minimum element @return null is the tree is empty
public K removeMinK(){
		if (!isEmpty()){
			K ret = root.getKey();
			remove(root);
			return ret;
		}
		return null;
	}
public K removeMinK ( ) { if ( ! isEmpty ( ) ) { K ret = root . getKey ( ) ; remove ( root ) ; return ret ; } return null ; }
Remove the minimum element from the heap, which is always the root node.
Remove the minimum element from the heap which is always the root node .