LeetCode173: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.

最开始想到的是由于这是棵二叉查找树，那么对这个树执行中序遍历，就是对其进行了排序，这样执行next()和hasNext()的时间复杂度是O(1)，空间复杂度是O(n)。由于刚刚使用非递归实现了中序遍历，于是这里也用非递归实现了。写顺手了发现使用非递归代码也不是很麻烦了。可是写完后显示Memory Limit Exceeded

即使这样还是把代码列出，因为正确的写法和这个很像.

/**
 * 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) {
        pos=0;
        if(root==NULL)
            return;
        stack<TreeNode*> s;
        TreeNode *node=root;
        while(!s.empty()||node)
        {
            while(node)
            {
                s.push(node);
                node=node->left;
            }
            node=s.top();
            vec.push_back(node);
            node=node->right;
        }

    }

    /** @return whether we have a next smallest number */
    bool hasNext() {
        return pos+1<vec.size();
    }

    /** @return the next smallest number */
    int next() {
        return vec[pos]->val;
    }

    private:
    vector<TreeNode *> vec;
    int pos;
};

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

然后才发现这道题要求的空间复杂度是O(h)，h是树的高度而不是树的总节点的数目，所以不能这样求解了。可是很想了一会儿也不明白如何将空间从O(n)转换到O(h)。最后看了Discuss发现它其实就是没有一下子将整棵树完全遍历，而是在执行next操作时执行遍历，这样就能保证空间复杂度是O(n)了。但是这样就只能使用二叉树的非递归遍历方式而不能使用递归遍历方式了。很巧妙的思路。
runtime:28ms

/**
 * 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)
        {
            s.push(root);
            root=root->left;
        }
    }

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

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

    private:
    stack<TreeNode*> s;

};

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