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.
Java:
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class BSTIterator {
public TreeNode current;
public Stack<TreeNode> stack;
public BSTIterator(TreeNode root) {
current = root;
stack = new Stack<TreeNode>();
while(current != null)
{
stack.push(current);
current = current.left;
}
}
/** @return whether we have a next smallest number */
public boolean hasNext() {
if(!stack.isEmpty() )
return true;
else return false;
}
/** @return the next smallest number */
public int next() {
current = stack.pop();
TreeNode result = current;
if(current.right != null)
{
TreeNode rightNode = current.right;
while(rightNode != null)
{
stack.push(rightNode);
rightNode = rightNode.left;
}
}
return result.val;
}
}
/**
* Your BSTIterator will be called like this:
* BSTIterator i = new BSTIterator(root);
* while (i.hasNext()) v[f()] = i.next();
*/