[leetcode]做题 617 合并二叉树

简单题，直接秒

class Solution {
public:
    TreeNode* mergeTrees(TreeNode* root1, TreeNode* root2) {
        if(root1==NULL)return root2;
        if(root2==NULL)return root1;
        root1->val+=root2->val;
        root1->left=mergeTrees(root1->left,root->left);
        root1->right=mergeTrees(root1->right,root->right);
        return root1;
    }
};