[230905] Leetcode - 530, 프런트엔드 개발의 변천 (2)

Leetcode - 530. Minimum Absolute Difference in BST

/**
 * @param {TreeNode} root
 * @return {number}
 */
var getMinimumDifference = function (root) {
    let result = Infinity
    let data = []

    const helper = (node) => {
        if (node.left) helper(node.left);
        data.push(node.val)
        if (node.right) helper(node.right);
    }
    helper(root);

    for (i = 0; i < data.length - 1; i++) {
        const value = data[i + 1] - data[i];
        result = value < result ? value : result;
    }
    return result;
};

Categories:

Updated:

Leave a comment