LintCode 86. 二叉查找树迭代器

题目: 二叉查找树迭代器

---

要求:

设计实现一个带有下列属性的二叉查找树的迭代器：

• 元素按照递增的顺序被访问（比如中序遍历）
• next()和hasNext()的询问操作要求均摊时间复杂度是O(1)

样例:

对于下列二叉查找树，使用迭代器进行中序遍历的结果为 [1, 6, 10, 11, 12]

   10
 /    \
1      11
 \       \
  6       12

算法要求:

额外空间复杂度是O(h)，其中h是这棵树的高度

Super Star：使用O(1)的额外空间复杂度

解题思路:

直接用List来存，接着用List的Iterator

算法如下:

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 * Example of iterate a tree:
 * BSTIterator iterator = new BSTIterator(root);
 * while (iterator.hasNext()) {
 *    TreeNode node = iterator.next();
 *    do something for node
 * } 
 */


public class BSTIterator {
    private LinkedList<TreeNode> list;
    Iterator<TreeNode> it;

    /*
    * @param root: The root of binary tree.
    */
    public BSTIterator(TreeNode root) {
        // do intialization if necessary
        list = new LinkedList<TreeNode>();
        Stack<TreeNode> stack = new Stack();
        TreeNode temp = root;
        while (temp != null || !stack.empty()) {
            while (temp != null) {
                stack.add(temp);
                temp = temp.left;
            }
            temp = stack.pop();
            list.add(temp);
            temp = temp.right;
        }
        it = list.iterator();
    }

    /*
     * @return: True if there has next node, or false
     */
    public boolean hasNext() {
        // write your code here
        return it.hasNext();
    }

    /*
     * @return: return next node
     */
    public TreeNode next() {
        // write your code here
        return it.next();
    }
}