题目描述:
输入两棵二叉树A,B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)
思路:
递归,从根节点开始比较,如果相等,再比较两个子节点。直到子树先为空为止,则为true;
//Java
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
public static boolean HasSubtree(TreeNode root1, TreeNode root2) {
boolean res = false;
if(root1 != null && root2 != null){
if(root1.val == root2.val){
res = Has1(root1,root2);
}
if(!res){res = HasSubtree(root1.left,root2);}
if(!res){res = HasSubtree(root1.right,root2);}
}
return res;
}
public static boolean Has1(TreeNode Node1, TreeNode Node2) {
if(Node2 == null){return true;}
if(Node1 == null){return false;}
if(Node1.val != Node2.val){return false;}
return Has1(Node1.left,Node2.left) && Has1(Node1.right,Node2.right);
}
}