Function dfs

javascript/0098-validate-binary-search-tree.js:17–22

(root, min, max)

};

const dfs = (root, min, max) => {
    const left = isValidBST(root.left, min, root.val);
    const right = isValidBST(root.right, root.val, max);

    return left && right;
};
// TODO
/**
 * https://leetcode.com/problems/validate-binary-search-tree/