[leetcode] 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.

Note: next() and hasNext() should run in average O(1) time and uses O(h) memory, where h is the height of the tree.
题意：
实现一个二叉搜索树的迭代器，开始时给定一个BST的根。调用next（）函数能够返回当前的最小值，并且next以及hasNext函数都要做到平均是O(1)的时间复杂度，O(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(root != NULL)
        {
            nodes.push(root);
            root = root->left;
        }
    }

    /** @return whether we have a next smallest number */
    bool hasNext() 
    {
        if(nodes.empty())return false;
        else return true;
    }

    /** @return the next smallest number */
    int next() 
    {
        if(hasNext())
        {
            TreeNode* node = nodes.top();
            nodes.pop();
            int res = node->val;
            node = node->right;
            while(node != NULL)
            {
                nodes.push(node);
                node = node->left;
            }
            return res;
        }
        else return -1;
    }
private:
    stack<TreeNode*> nodes;
};

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