Binary Search Tree Iterator Total Accepted: 2366 Total Submissions: 8230 My Submissions Question Solution
Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.
Calling next() will return the next smallest number in the BST.
Note: next() and hasNext() should run in average O(1) time and uses O(h) memory, where h is the height of the tree.
Credits:
Special thanks to @ts for adding this problem and creating all test cases.
<span style="font-size:18px;">/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class BSTIterator {
ArrayList<TreeNode> stack = new ArrayList<>();
public BSTIterator(TreeNode root) {
while(root != null){
stack.add(root);
root = root.left;
}
}
/** @return whether we have a next smallest number */
public boolean hasNext() {
return !stack.isEmpty();
}
/** @return the next smallest number */
public int next() {
int size = stack.size() - 1;
TreeNode node = stack.get(size);
stack.remove(size);
TreeNode right = node.right;
while(right != null){
stack.add(right);
right = right.left;
}
return node.val;
}
}
/**
* Your BSTIterator will be called like this:
* BSTIterator i = new BSTIterator(root);
* while (i.hasNext()) v[f()] = i.next();
*/</span>