刷题记录第七十一天-合并二叉树

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