173. 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.

Example:

BSTIterator iterator = new BSTIterator(root);
iterator.next();    // return 3
iterator.next();    // return 7
iterator.hasNext(); // return true
iterator.next();    // return 9
iterator.hasNext(); // return true
iterator.next();    // return 15
iterator.hasNext(); // return true
iterator.next();    // return 20
iterator.hasNext(); // return false

Note:

next() and hasNext() should run in average O(1) time and uses O(h) memory, where h is the height of the tree.
You may assume that next() call will always be valid, that is, there will be at least a next smallest number in the BST when next() is called.

方法1:

思路：

关键在于理解inorder的stack代表了什么含义，为什么要用到这个stack：stack的存在是为了我们找回来时的路。但是不一定立刻就去找到successor，如果call到了，再沿着栈顶元素去找。而做法就是首先将最左边的路径一路推进栈，每次从栈中pop来提取next。提取之后还要保证，如果栈顶有right，那么一路将top -> right 的left推入栈；如果没有right，栈顶本身就是successor。这样做完这一系列检查后，栈顶元素就可以保证是successor。

class BSTIterator {
public:
    BSTIterator(TreeNode *root) {
        while (root) {
            st.push(root);
            root = root -> left;
        }
    }

    /** @return whether we have a next smallest number */
    bool hasNext() {
        return !st.empty();
    }

    /** @return the next smallest number */
    int next() {
        int val = st.top() -> val;
        TreeNode* root = st.top();
        st.pop();
        if (root -> right) {
            root = root -> right;
            st.push(root);
            while (root -> left) {
                st.push(st.top() -> left);
                root = root -> left;
            }
        }
        return val;
    }
private:
    stack<TreeNode*> st;
};