617. Merge Two Binary Trees

最新推荐文章于 2020-01-20 03:32:57 发布

zshouyi

最新推荐文章于 2020-01-20 03:32:57 发布

阅读量290

点赞数

分类专栏： LeetCode Tree 文章标签： LeetCode Tree Merge Two Binary Tre

本文链接：https://blog.csdn.net/zshouyi/article/details/77351452

版权

LeetCode 同时被 2 个专栏收录

402 篇文章 0 订阅

订阅专栏

Tree

55 篇文章 0 订阅

订阅专栏

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.

可以选择一个树，从根节点递归刷新这个树，最后返回。代码如下：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public 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;
        }
        t1.val = t1.val + t2.val;
        if (t1.left != null) {
            mergeTrees(t1.left, t2.left);
        } else {
            t1.left = t2.left;
        }
        if (t1.right != null) {
            mergeTrees(t1.right, t2.right);
        } else {
            t1.right = t2.right;
        }
        return t1;
    }
}

简单点其实可以这么写：

public class Solution {
    public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
        if(null == t1) return t2;
        if(null == t2) return t1;
        t1.val += t2.val;
        t1.left = mergeTrees(t1.left, t2.left);
        t1.right = mergeTrees(t1.right, t2.right);
        return t1;
    }
}

也可以随时创建一个新的节点，保持原来的两棵树不变。

public class Solution {
    public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
        if (t1 == null) {
            return t2;
        } else if (t2 == null) {
            return t1;
        } else {
            TreeNode newRoot = new TreeNode(t1.val + t2.val);
            newRoot.left = mergeTrees(t1.left, t2.left);
            newRoot.right = mergeTrees(t1.right, t2.right);
            return newRoot;
        }
    }
}