题目描述
输入两棵二叉树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) {
if(root1==null||root2==null)return false;
//从根节点递归,不断左右子树去匹配
return (isSubtree(root1,root2)||HasSubtree(root1.left,root2)||HasSubtree(root1.right,root2));
}
public boolean isSubtree(TreeNode root1,TreeNode root2){
//B树匹配成功
if(root2==null)return true;
//A树遍历完
else if(root1==null)return false;
else if(root1.val!=root2.val)return false;
return (isSubtree(root1.left,root2.left)&&isSubtree(root1.right,root2.right));
}
}