[LeetCode]173. Binary Search Tree Iterator

mplement 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.

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

public class BSTIterator {
        TreeNode i = new TreeNode(0);

    public BSTIterator(TreeNode root) {
         i = root;
        
        
    }

    /** @return whether we have a next smallest number */
    public boolean hasNext() {
       
        if (this.i == null || this.i.right == null&& this.i.left == null) return false;
        else   return true;
    }

    /** @return the next smallest number */
    public int next() {
         if (this.hasNext() == false) {
            return i.val;
         }
         else {
            i= i.right;
            while (i.left != null) i = i.left;
            return i.val;
         }
        
    }
}

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