设计实现一个带有下列属性的二叉查找树的迭代器:
next()返回BST中下一个最小的元素
- 元素按照递增的顺序被访问(比如中序遍历)
next()
和hasNext()
的询问操作要求均摊时间复杂度是O(1)
样例
对于下列二叉查找树,使用迭代器进行中序遍历的结果为 [1, 6, 10, 11, 12]
10
/ \
1 11
\ \
6 12
挑战
额外空间复杂度是O(h),其中h是这棵树的高度
Super Star:使用O(1)的额外空间复杂度
解题思路:
非递归中序遍历的变形。
/**
* Definition of TreeNode:
* public class TreeNode {
* public int val;
* public TreeNode left, right;
* public TreeNode(int val) {
* this.val = val;
* this.left = this.right = null;
* }
* }
* Example of iterate a tree:
* BSTIterator iterator = new BSTIterator(root);
* while (iterator.hasNext()) {
* TreeNode node = iterator.next();
* do something for node
* }
*/
public class BSTIterator {
private List<TreeNode> list = new ArrayList<>();
private int i = 0;
/*
* @param root: The root of binary tree.
*/public BSTIterator(TreeNode root) {
// do intialization if necessary
Stack<TreeNode> stack = new Stack<>();
while(root!=null || !stack.isEmpty()){
while(root != null){
stack.push(root);
root = root.left;
}
root = stack.pop();
list.add(root);
root = root.right;
}
}
/*
* @return: True if there has next node, or false
*/
public boolean hasNext() {
// write your code here
if(i < list.size())
return true;
else
return false;
}
/*
* @return: return next node
*/
public TreeNode next() {
// write your code here
return list.get(i++);
}
}