René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/binary-search-tree-iterator","name":"#173 - Binary Search Tree Iterator - LeetCode JavaScript Solutions","description":"Implement the BSTIterator class that represents an iterator over the in-order traversal of a binary search tree (BST): BSTIterator(TreeNode...","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 */\nvar BSTIterator = function(root) {\n this.stack = [];\n this.root = root;\n};\n\n/**\n * @return {number}\n */\nBSTIterator.prototype.next = function() {\n while (this.root) {\n this.stack.push(this.root);\n this.root = this.root.left;\n }\n this.root = this.stack.pop();\n\n const result = this.root.val;\n this.root = this.root.right;\n return result;\n};\n\n/**\n * @return {boolean}\n */\nBSTIterator.prototype.hasNext = function() {\n return this.root || this.stack.length;\n};","keywords":"LeetCode 173, #173 - Binary Search Tree Iterator, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}