LeetCode 173. Binary Search Tree Iterator【Java】

题目描述

二叉搜索树的迭代器

AC代码

通过读题，很容易想到使用中序遍历去做，但是结合题目的限制，这道题目直接使用中序遍历去做不大合适，应该通过栈去模拟树的中序遍历。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class BSTIterator {
    Stack<TreeNode> stk=new Stack<>();
    public BSTIterator(TreeNode root) {
        while(root!=null){
            stk.push(root);
            root=root.left;
        }
    }
    
    /** @return the next smallest number */
    public int next() {
        TreeNode p=stk.peek();
        int val=p.val;
        stk.pop();
        p=p.right;
        while(p!=null){
            stk.push(p);
            p=p.left;
        }
        return val;
    }
    
    /** @return whether we have a next smallest number */
    public boolean hasNext() {
        return !stk.isEmpty();
    }
}

/**
 * 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();
 */