二叉树子结构和子树区别

子树

子树的与原树最终都为空结点

class Solution {
public:
    bool isSubtree(TreeNode* root, TreeNode* subRoot) {
        if(!root || !subRoot) return false;
        if(isSame(root,subRoot))
            return true;
        return isSubtree(root->left,subRoot)||isSubtree(root->right,subRoot);
    }
    bool isSame(TreeNode* root,TreeNode* subRoot){
        if(!root&&!subRoot) return true;
        if(!root || !subRoot) return false;
        if(root->val!=subRoot->val)
            return false;
        return isSame(root->left,subRoot->left) && isSame(root->right,subRoot->right);
    }
};

子结构

子树为空,原树不空

class Solution {
public:
    bool isSubStructure(TreeNode* A, TreeNode* B) {
        if(!A||!B) return false;
        if(isSub(A,B))
            return true;
        return isSubStructure(A->left,B) || isSubStructure(A->right,B);
    }
    bool isSub(TreeNode* A, TreeNode* B) {
         if(!B) return true;
         if(!A) return false;
       
        if(A->val!=B->val)
            return false;
        return  isSub(A->left,B->left)&&isSub(A->right,B->right); 
    }
};