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.

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

public class BSTIterator {
    
    public List<Integer> list = new ArrayList<Integer>();//存储遍历出的节点数据的有序列表
    public int current = 0;//现在访问的节点
    
    public BSTIterator(TreeNode root) {
        inorder(root);
    }

    /** @return whether we have a next smallest number */
    public boolean hasNext() {
        if(current < list.size()){
            return true;
        }
        return false;
    }

    /** @return the next smallest number */
    public int next() {
        return list.get(current++);
    }
    private void inorder(TreeNode root){
        if(root == null){
            return;
        }
        inorder(root.left);
        list.add(root.val);
        inorder(root.right);
    }
}

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

Runtime:325ms

这个运行时间快的有点离谱了，彻底相信是网速快了。。。。

还有一种改进是将递归遍历换成迭代方式，可能会快点，不过空间复杂度增加了