Simple JavaScript solution


  • 0
    /**
     * @param {TreeNode} t1
     * @param {TreeNode} t2
     * @return {TreeNode}
     */
    var mergeTrees = function(t1, t2) {
        if (!t1 && !t2) {
            return null;
        }
        
        if (!t1 || !t2) {
            return t1 || t2;
        }
        
        var root = new TreeNode(t1.val + t2.val);
        
        root.left = mergeTrees(t1.left, t2.left);
        root.right = mergeTrees(t1.right, t2.right);
        
        return root;
    };
    

Log in to reply
 

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