题目描述
输入两颗二叉树A,B,判断B是不是A的子结构。
递归嵌套递归!!!
/**
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 result=false;
if(root1==null||root2==null) return false;
if(root1.val==root2.val){
result=checkSubTree(root1,root2);
}
if(!result){
result=HasSubtree(root1.left,root2);
}
if(!result){
result=HasSubtree(root1.right,root2);
}
return result;
}
boolean checkSubTree(TreeNode root1,TreeNode root2) {
if(root2==null){
return true;
}else if(root1==null){
return false;
}else if(root1.val!=root2.val) return false;
return checkSubTree(root1.left,root2.left)&&checkSubTree(root1.right,root2.right);
}
}