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

Note: The merging process must start from the root nodes of both trees.

 

翻译：

给定两个二叉树并且想象当你用一个去覆盖另一个的时候，两棵树的有些节点会重叠而有些却不会。

你需要将它们合并成一棵新的二叉树。合并的规则是如果两个节点重叠，那么将两个节点的值相加作为合并后的节点的新值。否则，不为空的节点讲座为新树的节点。

例子 1:

输入: 
	树 1                     树 2                  
          1                         2                             
         / \                       / \                            
        3   2                     1   3                        
       /                           \   \                      
      5                             4   7                  
输出: 
合并后的树:
	     3
	    / \
	   4   5
	  / \   \ 
	 5   4   7

注意: 合并过程必须从两个树的根节点开始。

 

思路：

用递归来解决，若一棵树的节点为空，则返回另一棵树的节点作为合并后的新节点；若两棵树的节点都不为空，则新节点的值为两棵树的节点值的和。

 

C++代码（Visual Studio 2017):

#include "stdafx.h"
#include <iostream>
using namespace std;

struct TreeNode {
	int val;
	TreeNode* left;
	TreeNode* right;
	TreeNode(int x) :val(x), left(NULL), right(NULL) {}
};

class Solution {
public:
	TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
		if (t2 == NULL)
			return t1;
		if (t1 == NULL)
			return t2;
		TreeNode* t=new TreeNode(t1->val + t2->val);
		t->left = mergeTrees(t1->left, t2->left);
		t->right = mergeTrees(t1->right, t2->right);
		return t;
	}
};

void TreePrint(TreeNode* node) {
	if(node != NULL) {
		cout << node->val << " ";
		TreePrint(node->left);
		TreePrint(node->right);
	}
}

int main()
{
	Solution s;
	TreeNode* root1 = new TreeNode(1);
	root1->left = new TreeNode(3);
	root1->right = new TreeNode(2);
	root1->left->left = new TreeNode(5);

	TreeNode* root2 = new TreeNode(2);
	root2->left = new TreeNode(1);
	root2->right = new TreeNode(3);
	root2->left->right = new TreeNode(4);
	root2->right->right = new TreeNode(7);
	TreeNode* result = s.mergeTrees(root1, root2);
	TreePrint(result);
    return 0;
}