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 {
 *     public int val;
 *     public TreeNode left;
 *     public TreeNode right;
 *     public TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode MergeTrees(TreeNode t1, TreeNode t2) {
		if (t1 == null && t2 == null) {
			return null;
		} else if (t1 == null && t2 != null) {
			return t2;
		} else if(t1 != null && t2 == null) {
			return t1;
		}
		Merge(t1, t2);
		return t1;
    }
    
	public void Merge(TreeNode t1, TreeNode t2) {
		if (t1 != null && t2 != null) {
			t1.val = t1.val + t2.val;
			if (t1.left != null && t2.left != null) {
				Merge(t1.left, t2.left);
			}
			if (t1.right != null && t2.right != null) {
				Merge(t1.right, t2.right);
			}
		}
		if (t1.left == null && t2.left != null) {
			t1.left = t2.left;
		}
		if (t1.right == null && t2.right != null) {
			t1.right = t2.right;
		}
	}
}

null