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.
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class BSTIterator {
public:
stack<TreeNode*> pre;
BSTIterator(TreeNode *root)
{
in(root);
}
/** @return whether we have a next smallest number */
bool hasNext()
{
return !pre.empty();
}
/** @return the next smallest number */
int next()
{
TreeNode* temp = pre.top();
pre.pop();
in(temp->right);
return temp->val;
}
void in(TreeNode* root)
{
while(root!=NULL)
{
pre.push(root);
root = root->left;
}
}
};
/**
* Your BSTIterator will be called like this:
* BSTIterator i = BSTIterator(root);
* while (i.hasNext()) cout << i.next();
*/