【合并二叉树】LeetCode 617. Merge Two Binary Trees

题目描述

知识点

树

结果

实现

码前思考

1. emmm，看懂题目的意思应该就能动手写啦，（づ￣3￣）づ╭❤～

代码实现

/**
 * 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) {
        //将t2合并到t1吧
        if(t1 == NULL && t2 == NULL){
            return NULL;
        }
        if(t1 != NULL && t2 == NULL){
            //没有合并的必要了
            return t1;
        }
        if(t1 == NULL && t2 != NULL){
            //有合并的必要，直接返回t2吧
            return t2;
        }
        //合并值
        t1->val = t1->val+t2->val;
        //同时遍历左右
        t1->left = mergeTrees(t1->left,t2->left);
        t1->right = mergeTrees(t1->right,t2->right);
        return t1;
    }
};

码后反思

1. 据说这是软件所去年的机试题，(●’◡’●)。明天软件所夏令营要一帆风顺啊~