题解 | #合并二叉树#

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

class Solution {
public:
    /**
     * 
     * @param t1 TreeNode类 
     * @param t2 TreeNode类 
     * @return TreeNode类
     */
    TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
        if(t1==nullptr&&t2==nullptr)return nullptr;
        if(t1==nullptr)return t2;
        if(t2==nullptr)return t1;
        TreeNode*le=mergeTrees(t1->left, t2->left);
        TreeNode*ri=mergeTrees(t1->right, t2->right);
        t1->val+=t2->val;
        t1->left=le,t1->right=ri;
        return t1;
    }
};