算法期中1002. 合并二叉树

Description
输入两个二叉树T1和T2，要求对T1和T2进行合并. 合并是指将二叉树同一位置节点上的数求和，作为合并后二叉树相应位置节点的数值. 如果某个位置上只有一个二叉树有节点，则合并后的二叉树对应位置上的节点上的数值就等于这个节点上的数值.

例如：
T1 T2

      1                         2                            
     /  \                       /  \                           
    3   2                     1   3                       
   /                            \    \                      
  5                             4   7  

合并后：
3
/ \
4 5
/ \ \
5 4 7
T1和T2的结点数均不多于100000，每个结点的数值在1和1000之间.

请为下面的Solution类实现解决上述问题的merge函数，函数的两个参数T1和T2分别代表两个二叉树的根节点，函数返回值为合并后的二叉树的根节点.

/**
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* merge(TreeNode* T1, TreeNode* T2) {

}

};

注意：你只需要提交Solution类的代码，你在本地可以编写main函数测试程序，但不需要提交main函数的代码，也不需要提交TreeNode的定义. 注意不要修改类和函数的名称.

代码：

class Solution {
public:
    TreeNode* merge(TreeNode* T1, TreeNode* T2) {
        TreeNode* result = new TreeNode(0);
        TreeNode* left_1 = NULL;
        TreeNode* left_2 = NULL;
        TreeNode* right_1 = NULL;
        TreeNode* right_2 = NULL;

        if (T1 != NULL && T2 != NULL)
        {
            result->val = T1->val + T2->val;
            left_1 = T1->left;
            left_2 = T2->left;
            right_1 = T1->right;
            right_2 = T2->right;
        }
        else if (T1 == NULL && T2 != NULL) {
            result->val = T2->val;
            left_2 = T2->left;
            right_2 = T2->right;

        }
        else if (T1 != NULL && T2 == NULL) {
            result->val = T1->val;
            left_1 = T1->left;
            right_1 = T1->right;
        }
        else {
            return NULL;
        }

        result->left = merge(left_1, left_2);
        result->right = merge(right_1, right_2);
        return result;
    }
};                                 

错误解法：
这样，最后递归时，若T1->left等是NULL， 会报错——找不到该指针所指！！故应该向上面那样。等下，传入函数的不都是NULL么???

class Solution {
public:
    TreeNode* merge(TreeNode* T1, TreeNode* T2) {
        TreeNode* result = new TreeNode(0);

        if (T1 != NULL && T2 != NULL)
        {
            result->val = T1->val + T2->val;
        }
        else if (T1 == NULL && T2 != NULL) {
            result->val = T2->val;

        }
        else if (T1 != NULL && T2 == NULL) {
            result->val = T1->val;
        }
        else {
            return NULL;
        }
        result->left = merge(T1->left, T2->left);
        result->right = merge(T1->right, T2->right);
        return result;
    }
};                                 

验证的main()

int main() {
    Solution solution;

    TreeNode* t1 = new TreeNode(1);
    t1->left = new TreeNode(3);
    t1->right = new TreeNode(2);
    t1->left->left = new TreeNode(5);

    TreeNode* t2 = new TreeNode(2);
    t2->left = new TreeNode(1);
    t2->right = new TreeNode(3);
    t2->left->right = new TreeNode(4);
    t2->right->right = new TreeNode(7);

    TreeNode* result = solution.merge(t1, t2);
    system("pause");
    return 0;
}