[LeetCode 173] Binary Search Tree Iterator

原文地址：http://blog.csdn.net/doc_sgl/article/details/42372251

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.

二叉查找树还是得中序，中序得用栈。

我觉得这道题的题意有些不清，改为当前最小节点更好。

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class BSTIterator {
public:
    stack<TreeNode*> stk;
    BSTIterator(TreeNode *root) {
        while(!stk.empty())
            stk.pop();
        while(root)
        {
            stk.push(root);
            root=root->left;
        }
    }

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

    /** @return the next smallest number */
    int next() {
        TreeNode* tmp=stk.top();
        stk.pop();
        int val=tmp->val;
        tmp=tmp->right;
        while(tmp)
        {
            stk.push(tmp);
            tmp=tmp->left;
        }
        return val;
    }
};

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