剑指 Offer II 055. 二叉搜索树迭代器（Easy）

题目

题目及示例

我的题解

/**
 * 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 {
    private int index;

    private List<Integer> bst;

    public BSTIterator(TreeNode root) {
        index = 0;
        bst = new ArrayList<>();
        createBstList(root);
    }

    private void createBstList(TreeNode root) {
        if (root.left != null) {
            createBstList(root.left);
            bst.add(root.val);
            createBstList(root.right);
        } else {
            bst.add(root.val);
        }
    }

    public int next() {
        int next = bst.get(index);
        index++;
        return next;
    }

    public boolean hasNext() {
        return index < bst.size();
    }
}



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

其他题解

查看解法链接。

总结