题目:输入两棵二叉树A和B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)
——来源于《剑指offer》
- 思路:先依次比较A和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) {
if (root2 == null || root1 == null) {
return false;
}
return doesTree1HasTree2(root1, root2) ||
HasSubtree(root1.left, root2) ||
HasSubtree(root1.right, root2);
}
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);
}
}