Leetcode 617 Merge Two Binary Tree

分析：

1、如果tree1 == null ，那么则为tree2

2、如果tree2==null，那么则为tree1

3、如果tree1&&tree2 均不为空，

那么 利用利用递归:

                     TreeNode t = new treeNode(t1->val+t2->val) ;

                     t->left=mergeTree(t1->left,t2->left);

                    t->right=mergeTree(t1->right,t2->right);

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