-
Notifications
You must be signed in to change notification settings - Fork 7
/
Program.cs
64 lines (58 loc) · 1.31 KB
/
Program.cs
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
using System;
using System.Collections.Generic;
namespace BinarySearchTreeIteratorII
{
public class TreeNode
{
public int val;
public TreeNode left;
public TreeNode right;
public TreeNode(int val = 0, TreeNode left = null, TreeNode right = null)
{
this.val = val;
this.left = left;
this.right = right;
}
}
class Program
{
static void Main(string[] args)
{
Console.WriteLine("Hello World!");
}
}
public class BSTIterator
{
private readonly List<int> nodes;
private int pointer;
public BSTIterator(TreeNode root)
{
pointer = 0;
nodes = new List<int>();
DFS(root);
}
private void DFS(TreeNode root)
{
if (root == null) return;
DFS(root.left);
nodes.Add(root.val);
DFS(root.right);
}
public bool HasNext()
{
return pointer < nodes.Count - 1;
}
public int Next()
{
return nodes[++pointer];
}
public bool HasPrev()
{
return pointer > 0;
}
public int Prev()
{
return nodes[--pointer];
}
}
}