题目描述: 输入两棵二叉树A,B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)分析 将原始问题分为两个子问题 a. 在树A中寻找和树B根节点的值一样的结点node b. 判断在树A中以node为根节点的子树,是否和树B拥有一样的结构 代码
/**
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 ){
if (root1.val == root2.val)
result = doesTree1HasTree2(root1,root2);
if (!result)
result = HasSubtree(root1.left,root2);
if (!result)
result = HasSubtree(root1.right,root2);
}
return result;
}
public boolean doesTree1HasTree2 (TreeNode root1,TreeNode root2){
if (root2 == null )
return true ;
if (root1 == null )
return false ;
if (root1.val != root2.val)
return false ;
return doesTree1HasTree2(root1.left,root2.left) && doesTree1HasTree2(root1.right,root2.right); }
}