Merge Two Binary Trees [LeetCode 617]

最新推荐文章于 2024-11-04 12:20:00 发布

努力努力努力

最新推荐文章于 2024-11-04 12:20:00 发布

阅读量144

点赞数

分类专栏：算法设计与分析文章标签： leetcode

本文链接：https://blog.csdn.net/cyrususie/article/details/78907184

版权

算法设计与分析专栏收录该内容

24 篇文章 0 订阅

订阅专栏

题目链接

Answer

/**
 * 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 && t2 == NULL) return NULL;
        if (t1 == NULL) return t2;
        if (t2 == NULL) return t1;
        TreeNode* ans;
        ans = new TreeNode(t1 -> val + t2 -> val);
        ans -> left = mergeTrees(t1 -> left, t2 -> left);
        ans -> right = mergeTrees(t1 -> right, t2 -> right);
        return ans;
    }
};