二分搜索树-二叉搜索树迭代器（用非递归的方式遍历一颗树）领扣

思路：利用栈结构

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class BSTIterator {
    LinkedList<TreeNode> stack=new LinkedList<>();
    public BSTIterator(TreeNode root) {
       TreeNode cur=root;//从根开始
        while(cur!=null){//只要当前元素不是null，进栈
            stack.push(cur);//将当前的元素及其左子树的所有左孩子进栈
            cur=cur.left;
        }
    }
    /** @return the next smallest number */
    public int next() {
        TreeNode next=stack.pop();//将当前栈顶元素出栈
        TreeNode cur=next.right;//更新当前元素值
        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();
 */