budget/src/main/java/budget/backend/structures/BinaryTreeHeap.java
public boolean contains(BinaryTreeNode<K,V> node){
		if (isEmpty())
			return false;
		else
			return searchTree(root, node);
	}
/**
	 * Really expensive method in this implementaton, and should only be used when necessary.
	 * @return true if the tree contains the given node
	 * @return false otherwise
	 */
Really expensive method in this implementaton, and should only be used when necessary.
@return true if the tree contains the given node
@return false otherwise
Really expensive method in this implementaton and should only be used when necessary . @return true if the tree contains the given node @return false otherwise
public boolean contains(BinaryTreeNode<K,V> node){
		if (isEmpty())
			return false;
		else
			return searchTree(root, node);
	}
public boolean contains ( BinaryTreeNode < K , V > node ) { if ( isEmpty ( ) ) return false ; else return searchTree ( root , node ) ; }
Really expensive method in this implementaton, and should only be used when necessary.
Really expensive method in this implementaton and should only be used when necessary .