LeetCode617

合并两个二叉树

代码

按照树的遍历合并就好了

class Solution {
public:
    TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
        TreeNode* cur = new TreeNode;
        if (t1 == NULL)return t2;
        if (t2 == NULL)return t1;
        cur->val = t1->val + t2->val;
        cur->left = mergeTrees(t1->left, t2->left);
        cur->right = mergeTrees(t1->right, t2->right);
        return cur;
    }
  
};