京东自营 618 + 国补 iPhone 历史最低价
Java 给定一个二叉树，不使用递归按顺序打印节点。
给定一个二叉树，不使用递归按顺序打印节点。
实例源码：
源代码：
执行
执行中...
x
1
/* 来自 N o w J a v a . c o m*/2
3
import java.util.Stack;4
5
6
public class InorderTraversal {7
8
public static class Node {9
10
Node left;11
12
Node right;13
14
int value;15
16
17
public Node(int value) {18
19
this.value = value;20
21
}22
23
}24
25
26
// Traverse tree iteratively. We do this by replicating the same process27
28
// done recursively using an explicit stack29
30
public static void traverse(Node n) {31
32
Stack<Node> s = new Stack<Node>();33
34
// Add the leftmost branch to the stack35
36
addLeftToStack(s, n);37
/** 来自 n o w j a v a . c o m - 时代Java**/38
39
// While there are elements in the stack, pop and move the minimum40
41
// possible distance to the right42
43
while (!s.isEmpty()) {44
45
Node curr = s.pop();46
47
System.out.println(curr.value);48
49
50
// Add the right child and any of its left children to the stack51
52
addLeftToStack(s, curr.right);53
54
}55
56
}57
58
59
// As long as the current node has a left pointer, add it to the stack and 60
61
// continue62
63
private static void addLeftToStack(Stack<Node> s, Node n) {64
65
while (n != null) {66
67
s.push(n);68
69
n = n.left;70
71
}72
73
}74
75
76
/*77
78
* Sample test case79
80
* 81
82
* 883
84
* / \85
86
* 4 1287
88
* / \ / \89
90
* 1 6 9 1591
92
* / \93
94
* 5 1095
96
* 97
98
* Should print:99
100
* 1101
102
* 4103
104
* 5105
106
* 6107
108
* 8109
110
* 9111
112
* 10113
114
* 12115
116
* 15117
118
*/119
120
121
public static void main(String[] args) {122
123
Node n = new Node(8);124
125
n.left = new Node(4);126
/**代码未完, 请加载全部代码(NowJava.com).**/执行结果：
本文系作者在时代Java发表，未经许可，不得转载。如有侵权，请联系nowjava@qq.com删除。
编辑于
关注时代Java