mplement 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()规定的时间复杂度为O(1),而要求可以使用O(h)的memory.很容易想到用一个O(h)的stack来储存BST中的小数。
而初始化时,需要将h个小数放入stack中,可以选取BST中最左边的子节点,共h个,栈顶元素为最小元素。
每次next()取栈顶元素,并且将符合条件的值加入栈中。
class BSTIterator {
private:
stack<TreeNode*> st;
public:
BSTIterator(TreeNode *root) {
find_left(root);
}
/** @return whether we have a next smallest number */
bool hasNext() {
return !st.empty();
}
/** @return the next smallest number */
int next() {
TreeNode* top = st.top();
st.pop();
if (top->right != NULL)
find_left(top->right);
return top->val;
}
/** put all the left child() of root */
void find_left(TreeNode* root)
{
TreeNode* p = root;
while (p)
{
st.push(p);
p = p->left;
}
}
};