René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/split-bst","name":"#776 - Split BST - LeetCode JavaScript Solutions","description":"Given the root of a binary search tree (BST) and an integer target, split the tree into two subtrees where the first subtree has nodes that ...","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} target\n * @return {TreeNode[]}\n */\nvar splitBST = function(root, target) {\n  if (!root) return [null, null];\n\n  if (root.val <= target) {\n    const [smaller, larger] = splitBST(root.right, target);\n    root.right = smaller;\n    return [root, larger];\n  } else {\n    const [smaller, larger] = splitBST(root.left, target);\n    root.left = larger;\n    return [smaller, root];\n  }\n};","keywords":"LeetCode 776, #776 - Split BST, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}