输入两棵二叉树A,B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)
思路:找子结构,首先比较A和B是否相同,不同则继续递归拆分A(拆分的方式就是左右遍历),拆分后得到的树再与B比较。
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
bool compareTree(TreeNode* t1,TreeNode* t2)
{
if(t2 == NULL) return true;
if(t1 == NULL) return false;
if(t1->val != t2->val) return false;
return compareTree(t1->left,t2->left) && compareTree(t1->right,t2->right);
}
bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2)
{
if(pRoot1 == NULL || pRoot2 == NULL) return false;
return compareTree(pRoot1,pRoot2) || HasSubtree(pRoot1->left,pRoot2) || HasSubtree(pRoot1->right,pRoot2);
}
};