The following two static methods create the same binary tree.  Draw this binary tree:

public static BinaryTree<String> buildSimpleTree(){
	return new BinaryTree<String>("D",
			new BinaryTree<String>("B",
			  new BinaryTree<String>("A"),
			  new BinaryTree<String>("C")
			),
			new BinaryTree<String>("F",
			  new BinaryTree<String>("E"),
			  new BinaryTree<String>("H",
			    new BinaryTree<String>("G"),
			    new BinaryTree<String>("I")
			  )
			)
		  );
}

// same thing, but stores intermediary trees in local variables
public static BinaryTree<String> buildSimpleTree2(){
	BinaryTree<String> i = new BinaryTree<String>("I");
	BinaryTree<String> g = new BinaryTree<String>("G");
	BinaryTree<String> h = new BinaryTree<String>("H", g, i);
	
	BinaryTree<String> e = new BinaryTree<String>("E");
	
	BinaryTree<String> f = new BinaryTree<String>("F", e, h);
	
	BinaryTree<String> a = new BinaryTree<String>("A");
	BinaryTree<String> c = new BinaryTree<String>("C");
	BinaryTree<String> b = new BinaryTree<String>("B", a, c);
	
	BinaryTree<String> d = new BinaryTree<String>("D", b, f);
	
	return d;		
}