题目
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.
给一个二叉搜索树,写它的迭代器,要求用next()方法返回当前最小的元素,用hasNext()判断是否还有元素,利用一个栈s保存从根节点到最左的所有元素,根据栈s的空与否判断hasNext(),每次调用next()返回栈s的栈顶元素的值,同时对该元素从右孩子开始到最左侧的进行压栈,因为这些是下一次需要的元素。
/**
* 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!=NULL){//初始化为从根节点到最左侧的所有元素
s.push(root);
root=root->left;
}
}
/** @return whether we have a next smallest number */
bool hasNext() {
return !s.empty();//根据栈是否为空进行判断
}
/** @return the next smallest number */
int next() {
TreeNode* temp=s.top();//返回栈顶元素并弹栈
s.pop();
TreeNode* l=temp->right;//从栈顶的右孩子开始,到最左侧的所有元素压栈
while(l!=NULL){
s.push(l);
l=l->left;
}
return temp->val;
}
stack<TreeNode*> s;
};
/**
* Your BSTIterator will be called like this:
* BSTIterator i = BSTIterator(root);
* while (i.hasNext()) cout << i.next();
*/