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