617. 合并二叉树(c++/go)

最新推荐文章于 2023-03-18 18:29:56 发布

程序媛JD

最新推荐文章于 2023-03-18 18:29:56 发布

阅读量170

点赞数 1

分类专栏：力扣刷题笔记文章标签： c++ 深度优先算法

本文链接：https://blog.csdn.net/qq_36421001/article/details/125104908

版权

力扣刷题笔记专栏收录该内容

221 篇文章 6 订阅

订阅专栏

在这里插入图片描述

c++:

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* mergeTrees(TreeNode* root1, TreeNode* root2) {
        if(root1 == nullptr){
            return root2;
        }
        if(root2 == nullptr){
            return root1;
        }
        auto merged = new TreeNode(root1->val + root2->val);
        merged->left =  mergeTrees(root1->left,root2->left);
        merged->right = mergeTrees(root1->right,root2->right);
        return merged;

    }
};

Go:

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func mergeTrees(root1 *TreeNode, root2 *TreeNode) *TreeNode {
    if root1 == nil{
        return root2;
    }
    if root2 == nil{
        return root1;
    }
    root1.Val += root2.Val;
    root1.Left = mergeTrees(root1.Left,root2.Left);
    root1.Right = mergeTrees(root1.Right,root2.Right);
    return root1;
}