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