budget/src/main/java/budget/backend/structures/BinaryTreeHeap.java
public int onLevel(BinaryTreeNode<K,V> node){
		if (node.getParent() == null)
			return 0;
		else return (1+onLevel(node.getParent()));
	}
/**
	 * Count the number of ancestors of a node recursively, until the root is found.
	 * @param node a {@link BinaryTreeNode}
	 * @return the number of ancestors. The root is on level 0, its children are on level 1 etc.
	 */
Count the number of ancestors of a node recursively, until the root is found.
@param node a  BinaryTreeNode
@return the number of ancestors. The root is on level 0, its children are on level 1 etc.
Count the number of ancestors of a node recursively until the root is found . @param node a BinaryTreeNode @return the number of ancestors . The root is on level 0 its children are on level 1 etc .
public int onLevel(BinaryTreeNode<K,V> node){
		if (node.getParent() == null)
			return 0;
		else return (1+onLevel(node.getParent()));
	}
public int onLevel ( BinaryTreeNode < K , V > node ) { if ( node . getParent ( ) == null ) return 0 ; else return ( 1 + onLevel ( node . getParent ( ) ) ) ; }
Count the number of ancestors of a node recursively, until the root is found.
Count the number of ancestors of a node recursively until the root is found .