1. 中序遍歷后將節(jié)點(diǎn)保存至鏈表：

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

    public BSTIterator(TreeNode root) {
        midOrder(root);
    }
    
    /** @return the next smallest number */
    public int next() {
        if(list != null && list.size() > index){
            return list.get(index++).val;
        }else{
            return -1;
        }
    }
    
    /** @return whether we have a next smallest number */
    public boolean hasNext() {
        return (list != null && list.size() > index);
    }
    
    private int index = 0;
    private List<TreeNode> list = new ArrayList<>();
    private void midOrder(TreeNode root){
        if(root != null){
            midOrder(root.left);
            list.add(root);
            midOrder(root.right);
        }
    }
}

/**
 * Your BSTIterator object will be instantiated and called as such:
 * BSTIterator obj = new BSTIterator(root);
 * int param_1 = obj.next();
 * boolean param_2 = obj.hasNext();
 */

2. 用棧來(lái)存儲(chǔ)左側(cè)節(jié)點(diǎn)整吆，實(shí)現(xiàn)中序遍歷

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

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

    /** 初始化迭代器 */
    public BSTIterator(TreeNode root) {
        // 添加元素
        while(root!=null){
            stack.push(root);
            root = root.left;
        }
    }

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

    /** @return the next smallest number */
    public int next() {
        // 獲取并彈出最小元素
        TreeNode node = stack.pop();
        int min  = node.val;
        node = node.right;
        // 添加元素被彈出結(jié)點(diǎn)的右子樹上的較小元素
        while(node!=null){
            stack.push(node);
            node = node.left;
        }
        // 返回最小元素
        return min;
    }
}

/**
 * Your BSTIterator object will be instantiated and called as such:
 * BSTIterator obj = new BSTIterator(root);
 * int param_1 = obj.next();
 * boolean param_2 = obj.hasNext();
 */