[LeetCode]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.

思路：

给定两个二叉树，合并。
规则是如果该位置两个树都有值，则将两树的值加起来，如果一个有一个没有，则将有的那个树的值赋值
递归，用二叉树前序遍历，求每个位置的值，然后返回根节点。

 /**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution617 {
     public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
            if(t1 == null && t2==null) return null;
            if(t1 == null && t2!= null) return t2;
            if(t1 != null && t2== null) return t1;
            if(t1 != null && t2!= null) {
                t1.val += t2.val;
                t1.left=mergeTrees(t1.left, t2.left);
                t1.right=mergeTrees(t1.right, t2.right);
            }
            return t1;
        }
     public void shuchu(TreeNode treeNode){
        if(treeNode!=null){
             System.out.println(treeNode.val);
             shuchu(treeNode.left);
             shuchu(treeNode.right);
         }
     }
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Solution617 solution617 = new Solution617();
        TreeNode t1 = new TreeNode(1);
        t1.left = new TreeNode(3);
        t1.right = new TreeNode(2);
        t1.left.left = new TreeNode(5);
        TreeNode t2 = new TreeNode(2);
        t2.left = new TreeNode(1);
        t2.right = new TreeNode(3);
        t2.left.left = null;
        t2.left.right = new TreeNode(4);
        t2.right.left = null;
        t2.right.right = new TreeNode(7);
        TreeNode treeNode =solution617.mergeTrees(t1, t2);
        solution617.shuchu(treeNode);
    }

}