Merge Two Binary Trees

LeetCode 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

解决这道题的思路就是先遍历两个二叉树，然后根据节点情况（有一个数为空，都不为空，都为空）进行对应操作，都为空即完成了整个遍历，将合并后的树返回即可。需要注意的是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){
            return t2;
        }
        if(t2==null){
            return t1;
        }
        t1.val += t2.val;
        t1.left = mergeTrees(t1.left,t2.left);
        t1.right = mergeTrees(t1.right,t2.right);
        return t1;
    }
}

写一个测试类：

public class MergeTwoBinaryTrees {

public static void main(String[] args) {
    // TODO Auto-generated method stub
    //构造Tree 1
    TreeNode t1 = new TreeNode(1);
    t1.left = new TreeNode(3);
    t1.right = new TreeNode(2);
    t1.left.left = new TreeNode(5);

    //构造Tree 2
    TreeNode t2 = new TreeNode(2);
    t2.left = new TreeNode(1);
    t2.right = new TreeNode(3);
    t2.left.right = new TreeNode(4);
    t2.right.left = new TreeNode(7);

    mergeTrees(t1, t2);
    printTree(t1);
    //System.out.println(t1.val);


}

    public static TreeNode mergeTrees(TreeNode t1, TreeNode t2){

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

    public static void printTree(TreeNode t){
        if(t != null){
            System.out.print(t.val+" ");
            printTree(t.left);
            printTree(t.right);
        }
    }   
}

输出结果为3 4 5 4 5 7 ，正确。