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.

解题思路：生成一个栈，遍历二叉树，栈顶存储二叉树中最小的元素

Java代码实现：

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

public class BSTIterator {
    Stack sk=new Stack();

    public BSTIterator(TreeNode root) {
        if(root!=null){
            sk.push(root);
            TreeNode tn=(TreeNode)sk.peek();
            while(tn.left!=null){
                sk.push(tn.left);
                tn=tn.left;
            }
        }
        
    }

    /** @return whether we have a next smallest number */
    public boolean hasNext() {
        if(sk.isEmpty()) return false;
        else return true;
    }

    /** @return the next smallest number */
    public int next() {
        TreeNode sktop=(TreeNode)sk.pop();
        if(sktop.right!=null) {
            sk.push(sktop.right);
            TreeNode tn=(TreeNode)sk.peek();
            while(tn.left!=null){
                sk.push(tn.left);
                tn=tn.left;
            }
        }
        return sktop.val;
    }
}

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

原题地址： https://leetcode.com/problems/binary-search-tree-iterator/