2020年9月23日LC打卡

 

 递归算法easy题

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24

/**  * Definition for a binary tree node.  * struct TreeNode {  *     int val;  *     TreeNode *left;  *     TreeNode *right;  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}  * };  */ class Solution { public:     TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {         if(t1 == NULL) {             return t2;         }         if(t2 == NULL) {}             return t1;         }         auto ans = new TreeNode(t1->val + t2->val);         ans->left = mergeTrees(t1->left, t2->left);         ans->right = mergeTrees(t1->right, t2->right);         return ans;     } };