forked from onkardighe/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
_0173_Binary_Search_Tree_Iterator.java
72 lines (60 loc) · 1.39 KB
/
_0173_Binary_Search_Tree_Iterator.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
// https://leetcode.com/problems/binary-search-tree-iterator/
public class _0173_Binary_Search_Tree_Iterator
{
public static void main(String[] args) {
BSTIterator obj = new BSTIterator(new TreeNode());
}
}
/**
* 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;
* }
* }
*/
import java.util.*;
class BSTIterator {
private Queue<Integer> ele;
private int current;
public BSTIterator(TreeNode root)
{
ele = new LinkedList<>();
convert(root);
}
public int next()
{
return this.ele.remove();
}
public boolean hasNext()
{
if(this.ele.size() > 0)
{
return true;
}
return false;
}
private void convert(TreeNode root)
{
if(root == null)
{
return;
}
convert(root.left);
ele.add(root.val);
convert(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();
*/