Java easy to understand solution


  • 0
    C
    public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
            TreeNode newNode;
            if(t2==null)
                return t1;
            else if(t1==null)
                return t2;
            else
            {
                newNode=new TreeNode(t1.val+t2.val);
                newNode.left=mergeTrees(t1.left,t2.left);
                newNode.right=mergeTrees(t1.right,t2.right);
            }
            return newNode;
        }
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.