#define _CRT_SECURE_NO_WARNINGS 1


//力扣判断相同的树，到最后叶子节点都为空才是正确的
bool isSameTree(struct TreeNode* p, struct TreeNode* q) {
    if (p == NULL && q == NULL)              //都是空，true
        return true;

    else if (p == NULL || q == NULL)         //其中一个为空，false
        return false;

    if (p->val != q->val)
    {
        return false;
    }

    return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);

}



//检验另一个树是否为这个树的子树

bool isSameTree(struct TreeNode* p, struct TreeNode* q)
{
    if (p == NULL && q == NULL)
        return true;
    if (p == NULL || q == NULL)
        return false;
    if (q->val != p->val)
        return false;
    return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
}

bool isSubtree(struct TreeNode* root, struct TreeNode* subRoot) {
    if (root == NULL)
        return false;

    bool ret = isSameTree(root, subRoot);
    if (ret == true)
        return true;
    else
        return isSubtree(root->left, subRoot) || isSubtree(root->right, subRoot);
}