LeetCode173. 二叉搜索树迭代器（Java）

题目：

实现一个二叉搜索树迭代器。你将使用二叉搜索树的根节点初始化迭代器。

调用 next() 将返回二叉搜索树中的下一个最小的数。

示例：

代码：

• 解法一

/**
 * 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) {
        TreeNode cur=root;
        while(cur!=null){	//先将根节点和最左边子树全部进栈
            stack.push(cur);	//当前左子树进栈
            cur=cur.left;	//下一层子树的左子树进栈
        }
    }
    
    /** @return the next smallest number */
    public int next() {	//获取下一个最小元素
        TreeNode next=stack.pop();	//出栈
        TreeNode cur=next.right;	//cur指向当前树的右子树
        while(cur!=null){  //将右子树的左子树下一层 以此类推全部最左边子树全部进栈
           stack.push(cur);	//当前元素进栈
           cur=cur.left;	//下一层的左子树进栈
        }
        return next.val;	//返回当前结点的值
    }
    
    /** @return whether we have a next smallest number */
    public boolean hasNext() {	//是否有下一个元素
        return !stack.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();
 */

• 别人的代码

/**
 * 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 the next smallest number */
    public int next() {
        TreeNode node = stack.pop();
        if(node.right!=null){
            TreeNode temp = node.right;
            while(temp!=null){
                stack.push(temp);
                temp = temp.left;
            }
        }
        return node.val;
    }
    
    /** @return whether we have a next smallest number */
    public boolean hasNext() {
        if(stack.isEmpty())
            return false;
        return true;
    }
}

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