剑指offer之树的子结构

题目：
输入两棵二叉树A，B，判断B是不是A的子结构。（ps：我们约定空树不是任意一个树的子结构）

public class HashSubTree {
    public boolean HasSubtree(TreeNode root1,TreeNode root2) {
        boolean result = false;
        if(root2!=null && root1!= null){
            if(root1.val==root2.val){
                result = doesTree1HaveTree2(root1,root2);
            }
            if(!result){
                result = HasSubtree(root1.left, root2);
            }
            if(!result){
                result = HasSubtree(root1.right, root2);
            }
        }
        return result;
    }
    public  boolean doesTree1HaveTree2(TreeNode root1,TreeNode root2) {
        //必须先判断root2是否为空，再判断root1是否为空
        if(root2==null )
            return true;
        if(root1==null )
            return false;
        if(root1.val!=root2.val)
            return false;
        return doesTree1HaveTree2(root1.left, root2.left) && doesTree1HaveTree2(root1.right, root2.right);  
    }
    public static void main(String[] args) {
        TreeNode a= new TreeNode(0);
        TreeNode b= new TreeNode(1);
        TreeNode c= new TreeNode(2);
        TreeNode d= new TreeNode(3);
        TreeNode e= new TreeNode(4);
        TreeNode f= new TreeNode(5);
        TreeNode g= new TreeNode(6);
        TreeNode h= new TreeNode(7);
        TreeNode i= new TreeNode(8);
        TreeNode j= new TreeNode(9);
        a.left=b;
        a.right=c;
        b.left=d;
        b.right=e;
        c.left=f;
        c.right=g;
        d.left=h;
        d.right=i;
        e.left=j;
        HashSubTree tree = new HashSubTree();
        System.out.println(tree.HasSubtree(a, a));

    }
}

class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;
    public TreeNode(int val) {
        this.val = val;

    }
}