173、Binary Search Tree Iterator

题目：

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

解题思路：

维护一个栈，从根节点开始，每次迭代地将根节点的左孩子压入栈，直到左孩子为空为止。

调用next()方法时，弹出栈顶，如果被弹出的元素拥有右孩子，则以右孩子为根，将其左孩子迭代压栈。

c++版本：

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class BSTIterator {
    stack<TreeNode*> sta;
public:
    BSTIterator(TreeNode *root) {
        pushLeft(root);
    }

    /** @return whether we have a next smallest number */
    bool hasNext() {
        return sta.size()>0;
    }

    /** @return the next smallest number */
    int next() {
        TreeNode * node = sta.top();
        sta.pop();
        pushLeft(node->right);
        return node->val;
    }
    
    void pushLeft(TreeNode *root){
        while(root)
        {
            sta.push(root);
            root = root->left;
        }
    }
};

python版本：

# Definition for a  binary tree node
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class BSTIterator(object):
    def __init__(self, root):
        """
        :type root: TreeNode
        """
        self.stack = []
        self.pushLeft(root)
        
    def pushLeft(self,root):
        while(root):
            self.stack.append(root)
            root = root.left
        
    def hasNext(self):
        """
        :rtype: bool
        """
        return len(self.stack)>=1
        

    def next(self):
        """
        :rtype: int
        """
        top = self.stack.pop()
        self.pushLeft(top.right)
        return top.val