https://leetcode-cn.com/problems/binary-search-tree-iterator/
思路:对二叉搜索树进行中序遍历就可得到一个从小到大的有序序列。那么最简单的做法就是用一个数组存储中序遍历的结果。但是这个空间复杂度是
O
(
n
)
O(n)
O(n)的,怎么做到
O
(
h
)
O(h)
O(h)呢?使用非递归中序遍历即可。在非递归做法中,栈存储的是从根到某个节点的路径,所以空间复杂度最多为
O
(
h
)
O(h)
O(h)。关于如何用栈实现中序遍历,可以看我这一篇博客。
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class BSTIterator {
public:
BSTIterator(TreeNode* root) {
cur=root;
}
/** @return the next smallest number */
int next() {
while(cur){
s.push(cur);
cur=cur->left;
}
cur=s.top();
s.pop();
int val=cur->val;
cur=cur->right;
return val;
}
/** @return whether we have a next smallest number */
bool hasNext() {
if(cur||!s.empty())
return 1;
return 0;
}
private:
stack<TreeNode*> s;
TreeNode *cur;
};
/**
* Your BSTIterator object will be instantiated and called as such:
* BSTIterator* obj = new BSTIterator(root);
* int param_1 = obj->next();
* bool param_2 = obj->hasNext();
*/