budget/src/main/java/budget/backend/structures/BinaryTreeHeap.java
private String preOrder(BinaryTreeNode<K,V> n){
		String ret = "";
		if (n!=null){
			if (n.getValue() != null) ret += n.getValue();
			else ret += n.getKey();
			ret += ",";
			ret += preOrder(n.getLeft());
			ret += preOrder(n.getRight());
		}
		return ret;
	}
/**
	 * Make output, by recursively visiting all the nodes in pre-order traversal
	 */
Make output, by recursively visiting all the nodes in pre-order traversal
Make output by recursively visiting all the nodes in pre - order traversal
private String preOrder(BinaryTreeNode<K,V> n){
		String ret = "";
		if (n!=null){
			if (n.getValue() != null) ret += n.getValue();
			else ret += n.getKey();
			ret += ",";
			ret += preOrder(n.getLeft());
			ret += preOrder(n.getRight());
		}
		return ret;
	}
private String preOrder ( BinaryTreeNode < K , V > n ) { String ret = "" ; if ( n != null ) { if ( n . getValue ( ) != null ) ret += n . getValue ( ) ; else ret += n . getKey ( ) ; ret += "," ; ret += preOrder ( n . getLeft ( ) ) ; ret += preOrder ( n . getRight ( ) ) ; } return ret ; }
Make output, by recursively visiting all the nodes in pre-order traversal
Make output by recursively visiting all the nodes in pre - order traversal