题解 | #判断t1树中是否有与t2树完全相同的子树#

/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 * };
 */

class Solution {
public:
    /**
     * 
     * @param root1 TreeNode类 
     * @param root2 TreeNode类 
     * @return bool布尔型
     */
    bool isContains(TreeNode* root1, TreeNode* root2) {
        // write code here
        if(root1 == nullptr && root2 == nullptr){
            return true;
        }
        if(root1 == nullptr || root2 == nullptr){
            return false;
        }
        
        if(root1->val == root2->val){
            return isContains(root1->left, root2->left) && isContains(root1->right, root2->right);
        }
        
        return isContains(root1->left, root2) || isContains(root1->right, root2);
        
    }
};