题目描述
输入两棵二叉树A,B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)
思路:
1、通过递归遍历树A,寻找与树B中根结点的val值相等的结点;
2、分别遍历A、B,判断二者结构是否相等,若相等,则结束循环返回true;若不等,则继续遍历树A,寻找与树B中根结点的val值相等的结点.
public class Solution {
public boolean HasSubtree(TreeNode root1,TreeNode root2) {
if(root2==null||root1==null)return false;
return include(root1,root2);
}
public boolean include(TreeNode A,TreeNode B){
boolean result=false;
if(A==null)return false;
if(A.val==B.val){
result=judge(A,B);
}
if(!result){
result=include(A.left,B);
}
if(!result){
result=include(A.right,B);
}
return result;
}
public boolean judge(TreeNode A,TreeNode B){
if(B==null)return true;
if(A==null)return false;
if(A.val!=B.val)return false;
return judge(A.left,B.left)&&judge(A.right,B.right);
}
}
详见剑指offerP148