leetcode讲解--617. Merge Two Binary Trees

617. Merge Two Binary Trees

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.

这一题主要考察的点有两个：

1. 二叉树的遍历
2. 分类讨论的能力

java代码

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