AlgoDaily - Create A Binary Search Tree Iterator - Create A Binary Search Tree Iterator

Your Submissions

You haven't submitted any code for this challenge yet. Solve the problem by passing all the test cases, and your submissions will appear here.

xxxxxxxxxx
​
 
// Definition for a binary tree node.
// function TreeNode(val, leftNode, rightNode) {
//     this.val = (val===undefined ? 0 : val)
//     this.leftNode = (leftNode===undefined ? null : leftNode)
//     this.rightNode = (leftNode===undefined ? null : rightNode)
// }
 
// /**
//  * @param {Node} rootNode
//  */
​
​
​
var BSTInorderTraversal = function(rootNode) {
    // write code here
};
​
/**
 * @return {number}
 */
BSTInorderTraversal.prototype.nextNode = function() {
    // write code here
};
​
/**
 * @return {boolean}
 */

OUTPUT

Results will appear here.