LeetCode #617 - Merge Two Binary Trees

最新推荐文章于 2022-03-21 16:50:58 发布

LawFile

最新推荐文章于 2022-03-21 16:50:58 发布

阅读量178

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/LawFile/article/details/81263815

版权

LeetCode 专栏收录该内容

625 篇文章 1 订阅

订阅专栏

题目描述：

Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.

You need to merge them into a new binary tree. The merge rule is that if two nodes overlap, then sum node values up as the new value of the merged node. Otherwise, the NOT null node will be used as the node of new tree.

Example 1:

Input: 
	Tree 1                     Tree 2                  
          1                         2                             
         / \                       / \                            
        3   2                     1   3                        
       /                           \   \                      
      5                             4   7                  
Output: 
Merged tree:
	     3
	    / \
	   4   5
	  / \   \ 
	 5   4   7

Note: The merging process must start from the root nodes of both trees.

将两个二叉树合并，也就是将两个树叠加，如果两个节点重叠了那么就取它们的和。

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