budget/src/main/java/budget/backend/structures/BinaryTreeHeap.java
public V removeMinV(){
		if (!isEmpty()) {
			V ret = root.getValue();
			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 value 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 value 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 value of the minimum element @return null is the tree is empty
public V removeMinV(){
		if (!isEmpty()) {
			V ret = root.getValue();
			remove(root);
			return ret;
		}
		return null;
	}
public V removeMinV ( ) { if ( ! isEmpty ( ) ) { V ret = root . getValue ( ) ; 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 .