分享程序员开发的那些事...
更新时间：2022-09-20 23:30:47
C#实现二叉树的前序、中序、后序遍历。
|
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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
|
public class BinaryTreeNode
{
int value;
BinaryTreeNode left;
BinaryTreeNode right;
/// <summary>
/// 前序遍历
/// </summary>
/// <param name="tree"></param>
public static void PreOrder(BinaryTreeNode tree)
{
if (tree == null)
return;
System.Console.Write(tree.value + " ");
PreOrder(tree.left);
PreOrder(tree.right);
}
/// <summary>
/// 前序遍历循环实现
/// </summary>
/// <param name="tree"></param>
public static void PreOrderLoop(BinaryTreeNode tree)
{
if (tree == null)
return;
Stack<BinaryTreeNode> stack = new Stack<BinaryTreeNode>();
BinaryTreeNode node = tree;
while(node != null || stack.Any()){
if(node != null)
{
stack.Push(node);
System.Console.Write(node.value + " ");
node = node.left;
}
else
{
var item = stack.Pop();
node = item.right;
}
}
}
/// <summary>
/// 中序遍历
/// </summary>
/// <param name="tree"></param>
public static void InOrder(BinaryTreeNode tree)
{
if (tree == null)
return;
InOrder(tree.left);
System.Console.Write(tree.value + " ");
InOrder(tree.right);
}
/// <summary>
/// 中序遍历循环实现
/// </summary>
/// <param name="tree"></param>
public static void InOrderLoop(BinaryTreeNode tree)
{
if (tree == null)
return;
Stack<BinaryTreeNode> stack = new Stack<BinaryTreeNode>();
BinaryTreeNode node = tree;
while (node != null || stack.Any())
{
if (node != null)
{
stack.Push(node);
node = node.left;
}
else
{
var item = stack.Pop();
System.Console.Write(item.value + " ");
node = item.right;
}
}
}
/// <summary>
/// 后序遍历
/// </summary>
/// <param name="tree"></param>
public static void PostOrder(BinaryTreeNode tree)
{
if (tree == null)
return;
PostOrder(tree.left);
PostOrder(tree.right);
System.Console.Write(tree.value + " ");
}
/// <summary>
/// 后序遍历循环实现1
/// </summary>
/// <param name="tree"></param>
public static void PostOrderLoop(BinaryTreeNode tree)
{
if (tree == null)
return;
Stack<BinaryTreeNode> stack = new Stack<BinaryTreeNode>();
BinaryTreeNode node = tree;
BinaryTreeNode pre = null;
stack.Push(node);
while (stack.Any())
{
node = stack.Peek();
if ((node.left == null && node.right == null) ||
(pre != null && (pre == node.left || pre == node.right)))
{
System.Console.Write(node.value + " ");
pre = node;
stack.Pop();
}
else
{
if (node.right != null)
stack.Push(node.right);
if (node.left != null)
stack.Push(node.left);
}
}
}
/// <summary>
/// 后续遍历循环实现2
/// </summary>
/// <param name="tree"></param>
public static void PostOrderLoop2(BinaryTreeNode tree)
{
HashSet<BinaryTreeNode> visited = new HashSet<BinaryTreeNode>();
Stack<BinaryTreeNode> stack = new Stack<BinaryTreeNode>();
BinaryTreeNode node = tree;
while (node != null || stack.Any())
{
if (node != null)
{
stack.Push(node);
node = node.left;
}
else
{
var item = stack.Peek();
if (item.right != null && !visited.Contains(item.right))
{
node = item.right;
}
else
{
System.Console.Write(item.value + " ");
visited.Add(item);
stack.Pop();
}
}
}
}
}
|