用递归的方式遍历二叉树

1.先序遍历二叉树

class TreeNode{
   
    String  val;
    TreeNode right;
    TreeNode left;
    public TreeNode(String val){
   
        this.val=val;
    }
}
 class Test{
   
    public static TreeNode createTree(){
   
        TreeNode A=new TreeNode("A");
        TreeNode B=new TreeNode("B");
        TreeNode C=new TreeNode("C");
        TreeNode D=new TreeNode("D");
        TreeNode E=new TreeNode("E");
        TreeNode F=new TreeNode("F");
        TreeNode G=new TreeNode("G");
        TreeNode H=new TreeNode("H");
        A.left=B;
        A.right=C;
        B.left=D;
        B.right=E;
        E.right=H;
        C