-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.go
52 lines (38 loc) · 741 Bytes
/
main.go
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
package main
func main() {
}
type TreeNode struct {
Val int
Left *TreeNode
Right *TreeNode
}
type BSTIterator struct {
q []int
}
func Constructor(root *TreeNode) BSTIterator {
bst := BSTIterator{}
bst.getNode(root)
return bst
}
func (this *BSTIterator) getNode(root *TreeNode) {
if root == nil {
return
}
this.getNode(root.Left)
this.q = append(this.q, root.Val)
this.getNode(root.Right)
}
func (this *BSTIterator) Next() int {
val := this.q[0]
this.q = this.q[1:]
return val
}
func (this *BSTIterator) HasNext() bool {
return len(this.q) != 0
}
/**
* Your BSTIterator object will be instantiated and called as such:
* obj := Constructor(root);
* param_1 := obj.Next();
* param_2 := obj.HasNext();
*/