Binary Search Tree Iterator

题目：写一个BST遍历器
1. 初始化遍历器
2. next() will return the next smallest number in the BST
3. next() and hasNext() should run in average O(1) time and uses O(h) memory, where h is the height of the tree

解题思路：
因为BST的最小值永远在最左边，如果没有限制的话，只要用一个队列来存中序遍历的结果，即可；
可是这里只能用O(h)的空间；h为高度，所以，可以用一个栈来存根节点的所有左孩子，栈顶永远存的是最小值，当next()
的时候，如果节点有右孩子，则以它为根节点，所有的左孩子入栈；

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

public class BSTIterator {

    LinkedList<TreeNode> stack = new LinkedList<TreeNode> ();

    public BSTIterator(TreeNode root) {
        addToStack(root);
    }

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

    /** @return the next smallest number */
    public int next() {
        TreeNode node = stack.removeLast();
        addToStack(node.right);
        return node.val;
    }

    private void addToStack(TreeNode root) {
        while(root != null) {
            stack.add(root);
            root = root.left;
        }
    }
}

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