树的子结构——剑指offfer

题目描述

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

/**
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}
*/
public class Solution {
    public boolean HasSubtree(TreeNode root1,TreeNode root2) {
        boolean res = false;
		if (root1 != null && root2 != null) {
			if (root1.val == root2.val)
				res = tree1HasTree2(root1, root2);//如果根节点相等，就调用tree1HasTree2做第二步判断是不是每个节点对应相等</span>

			if (res != true)
				res = HasSubtree(root1.left, root2);//如果上面返回不是子结构，看左子树里是不是
			if (res != true)
				res = HasSubtree(root1.right, root2);//如果上面返回不是子结构，看右子树里是不是</span>
		}
		return res;
    }
 public boolean tree1HasTree2(TreeNode root1, TreeNode root2) {
		if (root2 == null)
			return true;
		if (root1 == null)
			return false;
		if (root1.val != root2.val)
			return false;
		return tree1HasTree2(root1.left, root2.left)
				&& tree1HasTree2(root1.right, root2.right);//左节点和右节点分别相等
	}
}