617. Merge Two Binary Trees

来源:互联网 发布:数据分析师就业前景 编辑:程序博客网 时间:2024/06/04 00:45

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.

实在没有做出来,这是别人的

public class Solution {

    public TreeNode MergeTrees(TreeNode l1, TreeNode l2) {
        if(l1==null)
            {
                return l2;
            }
            if(l2==null)
            {
                return l1;
            }
            l1.val += l2.val;
            l1.left = MergeTrees(l1.left,l2.left);
            l1.right = MergeTrees(l1.right,l2.right);
            return l1;
    }
}




原创粉丝点击