Question:
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.
分析:
给定一个二叉搜索树的根节点,实现一些关于这个二叉搜索树迭代器的一些功能:
如果调用hasNext()函数,则判断是否有下一个值是除了已经输出的最小值后剩余所有值中的最小值,有则返回true,否则返回false;
如果调用next(),就返回下一个除了已经输出的值后剩余值中的最小值;
要求如下:
<span style="font-size:14px;">/**
* Your BSTIterator will be called like this:
* BSTIterator i = BSTIterator(root);
* while (i.hasNext()) cout << i.next();
*/</span>
思路:
在类的构造函数初始化时候,采用中序遍历遍历这个二叉搜索树,并依次存储每个节点的val值到链表中,这样就会形成一个递增有序的链表,每次调用后next()函数后就将链表中的第一个元素删除,如果链表为空则说明没有下一个元素了。
代码如下:
<span style="font-size:14px;">/**
* 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) {
inOrder(root,valList);
}
/** @return whether we have a next smallest number */
bool hasNext() {
if(valList.empty())
return false;
return true;
}
/** @return the next smallest number */
int next() {
int res = valList.front();
valList.pop_front();
return res;
}
list<int> valList;
void inOrder(TreeNode *root,list<int>& vallist){
if(root == NULL)
return ;
else{
TreeNode *p = root;
if(p->left)
inOrder(p->left,vallist);
vallist.push_back(root->val);
if(p->right)
inOrder(p->right,vallist);
}
}
};
/**
* Your BSTIterator will be called like this:
* BSTIterator i = BSTIterator(root);
* while (i.hasNext()) cout << i.next();
*/</span>