leetcode617+两个二叉树合并，DP

小堃哥

于 2018-09-19 20:23:57 发布

阅读量98

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/u013554860/article/details/82777718

版权

Leetcode 专栏收录该内容

450 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/merge-two-binary-trees/description/

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) return t2;
        if(!t2) return t1;
        t1->val = t1->val + t2->val;
        t1->left = mergeTrees(t1->left, t2->left);
        t1->right = mergeTrees(t1->right, t2->right);
        return t1;
    }
};