LeetCode::Binary Search Tree Iterator

题目

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.

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

分析

其实最难得就是空间要求是O(h)，不然整个题目其实等与从小到大输出，存个栈就好了，不过空间就O(n)了。

解决方法仍然是用栈，但是一开始只压入整棵树的左边一枝，然后每出栈一个节点，就压入这个节点的右子树，方法和压入整个树一样，递归的感觉。

有了栈，栈里存放目前最小的<=h个节点，查询是O(1)，看栈顶是不是空就行了。

代码

/**
 * 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 (NULL != root)
        {
            //as BST, the left sub-tree are smaller
            myStack_.push(root);
            root = root->left;
        }
        
    }

    /** @return whether we have a next smallest number */
    bool hasNext() {
        //if the stack is empty, then no node is smaller than the current one
        return !myStack_.empty();
    }

    /** @return the next smallest number */
    int next() {
        // pick up the smallest node
        TreeNode *smallest = myStack_.top();
        myStack_.pop();
        
        // if this node has right sub-tree,
        // then push them since they are smaller than the new stack top
        // remember the new stack top is theirs grandparent
        TreeNode *tmp = smallest->right;
            
        while (NULL != tmp)
        {
            myStack_.push(tmp);
            tmp = tmp->left;
        }
        
        return smallest->val;
    }
private:
    stack<TreeNode* > myStack_;
};

/**
 * Your BSTIterator will be called like this:
 * BSTIterator i = BSTIterator(root);
 * while (i.hasNext()) cout << i.next();
 */