Leetcode 617 Merge Two Binary Trees

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
        TreeNode t=new TreeNode(0);
        t.left=new TreeNode(0);
        t.right=new TreeNode(0);
        if(t1!=null&&t2!=null){
            t.val=t1.val+t2.val;
            t.left=mergeTrees(t1.left,t2.left);
            t.right=mergeTrees(t1.right,t2.right);
            return t;
        }
        else if(t1==null&&t2==null){
            t=null;
            return t;
        }
        else if(t1==null){
            t.val=t2.val;
            t.left=mergeTrees(null,t2.left);
            t.right=mergeTrees(null,t2.right);
            return t;
        }
        else{
            t.val=t1.val;
            t.left=mergeTrees(t1.left,null);
            t.right=mergeTrees(t1.right,null);
            return t;
        }
    }
}