leetcode学习笔记173 Binary Search Tree Iterator

问题

Binary Search Tree Iterator

Implement the BSTIterator class that represents an iterator over the in-order traversal of a binary search tree (BST):

• BSTIterator(TreeNode root) Initializes an object of the BSTIterator class. The root of the BST is given as part of the constructor. The pointer should be initialized to a non-existent number smaller than any element in the BST.
• boolean hasNext() Returns true if there exists a number in the traversal to the right of the pointer, otherwise returns false.
• int next() Moves the pointer to the right, then returns the number at the pointer.
  Notice that by initializing the pointer to a non-existent smallest number, the first call to next() will return the smallest element in the BST.

You may assume that next() calls will always be valid. That is, there will be at least a next number in the in-order traversal when next() is called.

Example 1:

Input
[“BSTIterator”, “next”, “next”, “hasNext”, “next”, “hasNext”, “next”, “hasNext”, “next”, “hasNext”]
[[[7, 3, 15, null, null, 9, 20]], [], [], [], [], [], [], [], [], []]
Output
[null, 3, 7, true, 9, true, 15, true, 20, false]
Explanation
BSTIterator bSTIterator = new BSTIterator([7, 3, 15, null, null, 9, 20]);
bSTIterator.next(); // return 3
bSTIterator.next(); // return 7
bSTIterator.hasNext(); // return True
bSTIterator.next(); // return 9
bSTIterator.hasNext(); // return True
bSTIterator.next(); // return 15
bSTIterator.hasNext(); // return True
bSTIterator.next(); // return 20
bSTIterator.hasNext(); // return False

Constraints:

• The number of nodes in the tree is in the range [1, 105].
• 0 <= Node.val <= $10^6$
• At most $10^5$ calls will be made to hasNext, and next.

Follow up:

Could you implement next() and hasNext() to run in average O(1) time and use O(h) memory, where h is the height of the tree?

方法1

不考虑followup的话很简单, 用一个列表按照中序遍历保存所有的值就可以了

空间复杂度$O(n)$.

next()/hasNext() 时间复杂度$O(1)$.

class BSTIterator {

    Deque<TreeNode> que = new ArrayDeque<TreeNode>();
    
    public BSTIterator(TreeNode root) {
        helper(root);
    }
    
    private void helper(TreeNode node){
        if(node == null)
            return;
        
        helper(node.left);
        que.offer(node);
        helper(node.right);
    }
    
    public int next() {
        return que.poll().val;
    }
    
    public boolean hasNext() {
        return !que.isEmpty();
    }
}

方法2

在followup中, 如果额外空间不是$O(n)$. 而是$O(h)$的话, 也就是说不是存下所有的节点, 而是只存下每一层的左节点, 在每次next() 之后,将右节点以及子左节点(如果有的话)储存起来以便下次使用.

空间复杂度$O(h)$.

next()/hasNext() 时间复杂度$O(1)$.

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class BSTIterator {

    Deque<TreeNode> que = new ArrayDeque<TreeNode>();
    
    public BSTIterator(TreeNode root) {
        helper(root);
    }
    
    // 将左节点全部储存到que中
    private void helper(TreeNode node){
        while(node != null){
            que.push(node);
            node = node.left;
        }
    }
    
    public int next() {
    	// 弹出当前节点并返回
        TreeNode node = que.pop();
        // 将当前节点的右节点以及对应的左节点储存
        helper(node.right);
        return node.val;
    }
    
    public boolean hasNext() {
        return !que.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();
 */