René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/invert-binary-tree","name":"#226 - Invert Binary Tree - LeetCode JavaScript Solutions","description":"Invert a binary tree. ...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * Definition for a binary tree node.\n * function TreeNode(val) {\n * this.val = val;\n * this.left = this.right = null;\n * }\n */\n/**\n * @param {TreeNode} node\n * @return {TreeNode}\n */\nvar invertTree = function(node) {\n if (node) [node.left, node.right] = [invertTree(node.right), invertTree(node.left)];\n return node;\n};","keywords":"LeetCode 226, #226 - Invert Binary Tree, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}