86. 二叉查找树迭代器
描述
设计实现一个带有下列属性的二叉查找树的迭代器:
元素按照递增的顺序被访问(比如中序遍历)
next()和hasNext()的询问操作要求均摊时间复杂度是O(1)
样例
对于下列二叉查找树,使用迭代器进行中序遍历的结果为 [1, 6, 10, 11, 12]
10
/ \
1 11
\ \
6 12
代码
时间复杂度为O(h)。
/**
* 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
* }
*/
import java.util.*;
public class BSTIterator {
/*
* @param root: The root of binary tree.
*/
TreeNode root;
Stack<TreeNode> inorder=new Stack<>();
public BSTIterator(TreeNode root) {
// do intialization if necessary
this.root=root;
in(root);
}
void in(TreeNode root){
if(root!=null){
inorder.push(root);
while(root.left!=null){
inorder.push(root.left);
root=root.left;
}
}
}
/*
* @return: True if there has next node, or false
*/
public boolean hasNext() {
// write your code here
if(inorder.empty()){
return false;
}
return true;
}
/*
* @return: return next node
*/
public TreeNode next() {
// write your code here
if(hasNext()){
TreeNode node=inorder.pop();
if(node.right!=null){
in(node.right);
}
return node;
}
return null;
}
}