题目描述
输入两棵二叉树A,B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)
示例1
输入
{8,8,#,9,#,2,#,5},{8,9,#,2}返回值
true
/**
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) {
if(root1==null || root2==null) return false;
return isSubTree(root1, root2) || HasSubtree(root1.left, root2) ||HasSubtree(root1.right, root2);
}
public boolean isSubTree(TreeNode a, TreeNode b){
if(b==null) return true;
if(a==null) return false;
if(a.val == b.val){
return isSubTree(a.left, b.left) && isSubTree(a.right, b.right);
}else{
return false;
}
}
}