思路
根据二叉搜索树中序遍历得到的结果为从小到大依次排列,得出答案。
这糟糕的算法
代码
/**
* 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 {
TreeNode root;
List<Integer> list = new ArrayList<>();
public BSTIterator(TreeNode root) {
this.root = root;
inorder(root);
}
public int next() {
return list.remove(0);
}
public boolean hasNext() {
return list.size() != 0;
}
public void inorder(TreeNode root){
if (root == null) return;
inorder(root.left);
list.add(root.val);
inorder(root.right);
}
}
/**
* 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();
*/