LeetCode 617. Merge Two Binary Trees

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.

三、解题思路

• 二叉树的遍历
• 递归算法。这道题的意思是把两个二叉树对应位置的val相加，组合成一个新的二叉树。设计到的算法是二叉树的遍历，这里我们采用中序遍历的递归实现。分为三种情况，两个节点都为NULL、两个节点都不为NULL、两个节点一个NULL一个不是NULL。递归实现很简单，看代码就行了。

/**
 * Definition for a binary tree node.
 * 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) {
        TreeNode* newNode = new TreeNode(0);
        if(t1 != NULL && t2 != NULL){
            newNode->val = t1->val + t2->val;
            newNode->left = mergeTrees(t1->left, t2->left);
            newNode->right = mergeTrees(t1->right, t2->right);
            return newNode;
        }else if(t1 != NULL && t2 == NULL){
            newNode->val = t1->val;
            newNode->left = mergeTrees(t1->left, NULL);
            newNode->right = mergeTrees(t1->right, NULL);
            return newNode;
        }else if(t1 == NULL && t2 != NULL){
            newNode->val = t2->val;
            newNode->left = mergeTrees(NULL, t2->left);
            newNode->right = mergeTrees(NULL, t2->right);
            return newNode;
        }else {
            return NULL;
        }
    }
};