René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/second-minimum-node-in-a-binary-tree","name":"#671 - Second Minimum Node In a Binary Tree - LeetCode JavaScript Solutions","description":"Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactly two or zero ...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * Definition for a binary tree node.\n * function TreeNode(val, left, right) {\n * this.val = (val===undefined ? 0 : val)\n * this.left = (left===undefined ? null : left)\n * this.right = (right===undefined ? null : right)\n * }\n */\n/**\n * @param {TreeNode} root\n * @return {number}\n */\nvar findSecondMinimumValue = function(root) {\n return root ? (n => n === Infinity ? -1 : n)(traverse(root, root.val)) : -1;\n function traverse(node, min) {\n if (!node) return Infinity;\n if (node.val > min) return node.val;\n return Math.min(traverse(node.left, min), traverse(node.right, min));\n }\n};","keywords":"LeetCode 671, #671 - Second Minimum Node In a Binary Tree, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}