Repository navigation
Expand file tree
/
Copy pathInorderStack.java
More file actions
92 lines (74 loc) · 2.14 KB
/
Copy pathInorderStack.java
File metadata and controls
92 lines (74 loc) · 2.14 KB
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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
package LeetCode;
import java.util.*;
/**
* Created by Samarth on 3/13/2015.
*/
public class InorderStack {
public static void main(String args[]) throws Exception
{
/*TreeNode root = new TreeNode(1);
root.left = new TreeNode(2);
root.left.left = new TreeNode(3);
root.left.right = new TreeNode(4);
root.right = new TreeNode(5);
root.right.left = new TreeNode(6); */
TreeNode root = new TreeNode(1);
root.right = new TreeNode(5);
List<Integer> result = inorderTraversal(root);
for (int a : result)
{
System.out.print(a + " ");
}
}
public static List<Integer> inorderTraversal(TreeNode root) {
List<Integer> result = new ArrayList<Integer>();
Stack<TreeNode> stack = new Stack<TreeNode>();
return inorderStack(root, stack, result);
}
static List<Integer> inorderStack(TreeNode root, Stack stack, List<Integer> result)
{
boolean traversalComplete = false;
while (traversalComplete != true)
{
if (root != null)
{
stack.push(root);
root = root.left;
}
else
{
if (stack.isEmpty())
{
traversalComplete = true;
}
else
{
TreeNode popNode = (TreeNode)stack.pop();
//System.out.println("Hey " + popNode.data);
result.add(popNode.data);
root = popNode.right;
}
//stack.push(root);
//if (root != null)
//{
//System.out.println("Hey bbb " + root.data);
//}
}
//if (stack.isEmpty())
//{
//traversalComplete = true;
//}
}
return result;
}
static class TreeNode
{
public Integer data;
public TreeNode left;
public TreeNode right;
public TreeNode(int data)
{
this.data = data;
}
}
}