leetcode 617. Merge Two Binary Trees 二叉树合并 + 深度优先遍历DFS

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.

本题题意很简单，直接合并即可

代码如下：

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <climits>
#include <algorithm>
#include <sstream>
#include <functional>
#include <bitset>
#include <numeric>
#include <cmath>
#include <regex>

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 (t1 == NULL && t2 == NULL)
return NULL;
else if (t1 == NULL && t2 != NULL)
return t2;
else if (t1 != NULL && t2 == NULL)
return t1;
else
{
TreeNode* root = new TreeNode(t1->val+t2->val);
root->left = mergeTrees(t1->left,t2->left);
root->right = mergeTrees(t1->right,t2->right);
return root;
}
}
};