leetcode: Binary Search Tree Iterator

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */

public class BSTIterator {

    static Stack<TreeNode> trs = new Stack<TreeNode>();
    public BSTIterator(TreeNode root) {
        pushLeft(root);
    }

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

    /** @return the next smallest number */
    public int next() {
        TreeNode tmp = trs.peek();
        trs.pop();
        pushLeft(tmp.right);
        return tmp.val;
    }
    
    public static void pushLeft(TreeNode root)
    {
        if(root!=null)
        {
            trs.push(root);
            TreeNode tmp = root;
            while(tmp.left!=null)
            {
                trs.push(tmp.left);
                tmp = tmp.left;
            }
        }
    }
}

/**
 * Your BSTIterator will be called like this:
 * BSTIterator i = new BSTIterator(root);
 * while (i.hasNext()) v[f()] = i.next();
 */

用一个栈来维护BST的最小值....显然，初始的最小值应该是root的最左子结点...

而hasNext()需要我们在返回这个最小值后更新最小值tmp...由于tmp没有左子结点（最小），所以其右子结点的最左子结点是next最小值（如其没有右子结点则为父节点）

这样我们在每次返回tmp的时候判断一下更新栈中的值即可