René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/correct-a-binary-tree","name":"#1660 - Correct a Binary Tree - LeetCode JavaScript Solutions","description":"You have a binary tree with a small defect. There is exactly one invalid node where its right child incorrectly points to another node at th...","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 * @param {number} from\n * @param {number} to\n * @return {TreeNode}\n */\nvar correctBinaryTree = function(root) {\n const set = new Set();\n return traverse(root, null, false);\n\n function traverse(node, parent, isLeft) {\n if (!node) return null;\n\n if (node.right && set.has(node.right)) {\n if (parent) {\n if (isLeft) {\n parent.left = null;\n } else {\n parent.right = null;\n }\n }\n return null;\n }\n\n set.add(node);\n\n node.right = traverse(node.right, node, false);\n node.left = traverse(node.left, node, true);\n\n return node;\n }\n};","keywords":"LeetCode 1660, #1660 - Correct a Binary Tree, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}