【LeetCode】617合并二叉树

思路：递归。

    public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
        if(t1==null&&t2==null) return null;
        
        TreeNode t3=new TreeNode((t1==null?0:t1.val)+(t2==null?0:t2.val));
        t3.left=mergeTrees(t1==null?t1:t1.left,t2==null?t2:t2.left);
        t3.right=mergeTrees(t1==null?t1:t1.right,t2==null?t2:t2.right);
        
        return t3;
    }