leetcode_25_另一棵树的子树

 

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */

bool isSameTree(struct TreeNode* p, struct TreeNode* q){
    if(p==NULL && q==NULL)
        return true;
 
    //其中一个为空
    if(p==NULL || q==NULL)
        return false;
 
    //都不为空,且首节点的值不相等
    if(p->val != q->val)
        return false;
    
    //p和q的值相等，分别比较左子树和右子树
    return isSameTree(p->left,q->left) && isSameTree(p->right,q->right);
}

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

    return isSubtree(root->left,subRoot) || isSubtree(root->right,subRoot);
}