public static <T extends Comparable<T>, E> void print(Map<String, String> content, String testName, Node<T,E> root,
			boolean printHeader, boolean printFooter){
		if(printHeader)
			printHeader(testName);
		
		if(content!=null)
			for(String str : content.keySet()){
				System.out.print(str);
				for(int i=0; i<(30 -str.length()) ; i++)
					System.out.print(" ");
				System.out.print("  :  ");
				System.out.println(content.get(str));
			}
		
		if(root!=null){
			BinaryTreePrinter.printNode(root);
		}
		
		if(printFooter)
			printFooter();
	}