-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathinorderTraversal.java
More file actions
executable file
·61 lines (50 loc) · 1.4 KB
/
inorderTraversal.java
File metadata and controls
executable file
·61 lines (50 loc) · 1.4 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
package stack;
/**给定一个二叉树，返回其中序遍历。
例如：
给定二叉树 [1,null,2,3],
1
\
2
/
3
返回 [1,3,2].
说明: 递归算法很简单，你可以通过迭代算法完成吗？
* Created by Administrator on 2018/4/10 0010.
*/
import array.LIS;
import java.util.ArrayList;
import java.util.List;
import java.util.Stack;
public class inorderTraversal {
public static class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) { val = x; }
}
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> result=new ArrayList<>();
if(root==null)
return result;
result.addAll(inorderTraversal(root.left));
result.add(root.val);
result.addAll(inorderTraversal(root.right));
return result;
}
public List<Integer> inorderTraversal2(TreeNode root){
List<Integer> result=new ArrayList<>();
Stack<TreeNode> stack=new Stack<>();
while (root!=null || stack.size()!=0){
if(root!=null) {
stack.push(root);
root = root.left;
}
else {
TreeNode curNode=stack.pop();
result.add(curNode.val);
root=curNode.right;
}
}
return result;
}
}