合并二叉树

class Solution {
public:
    TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
        TreeNode* root;
        if(t1==nullptr&&t2 == nullptr){
            return 0;
        }
        else if(t1!=nullptr&&t2 == nullptr){
            root = new TreeNode(t1 -> val);
            root -> left = mergeTrees(t1->left, t2);
            root -> right = mergeTrees(t1->right,t2);
        }
        else if(t1==nullptr&&t2 != nullptr){
            root = new TreeNode(t2 -> val);
            root -> left = mergeTrees(t1, t2->left);
            root -> right = mergeTrees(t1,t2->right);
        }
        else if(t1!=nullptr&&t2 != nullptr){
            root = new TreeNode(t1 -> val + t2 -> val);
            root -> left = mergeTrees(t1->left, t2->left);
            root -> right = mergeTrees(t1->right,t2->right);
        }
        return root;
    }
};