题目描述
输入两棵二叉树A,B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)
解题思路
递归,先判断当前两结点是否相等,然后如果B的左子树不空,则判断A的左子树和B的左子树是否一样,若相同,则如果B的右子树也不为空且和A的一样时,返回true,当B的左或右子树为空时,则跳过对应的验证。若当前结点不等,则return A的左子树和B的结果 && A的右子树和B的结果。
Code
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2)
{
if(pRoot1 == nullptr || pRoot2 == nullptr) {
return false;
}
bool result = true;
if(pRoot1->val == pRoot2->val) {
if(pRoot2->left != nullptr) {
result = HasSubtree(pRoot1->left, pRoot2->left);
}
if(result && pRoot2->right != nullptr) {
result = HasSubtree(pRoot1->right, pRoot2->right);
}
if(result) return true;
}
return HasSubtree(pRoot1->left, pRoot2) || HasSubtree(pRoot1->right, pRoot2);
}
};
- java
/**
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(root1 == null || root2 == null) return false;
boolean result = true;
if(root1.val == root2.val) {
if(root2.left != null) {
result = HasSubtree(root1.left, root2.left);
}
if(result && root2.right != null) {
result = HasSubtree(root1.right, root2.right);
}
if(result) return result;
}
return HasSubtree(root1.left, root2) || HasSubtree(root1.right, root2);
}
}