CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-02-08 21:34:17 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix code naming style.

Browse Source
This commit is contained in:
krahets
2023-10-15 21:18:09 +08:00
parent ada37fd1f8
commit 346c8451de
23 changed files with 51 additions and 51 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
codes/csharp/chapter_tree/array_binary_tree.cs
View File

@@ -55,18 +55,18 @@ public class ArrayBinaryTree {
}
/* 深度优先遍历 */
private void Dfs(int i, string order, List<int> res) {
private void DFS(int i, string order, List<int> res) {
// 若为空位，则返回
if (!Val(i).HasValue)
return;
// 前序遍历
if (order == "pre")
res.Add(Val(i).Value);
Dfs(Left(i), order, res);
DFS(Left(i), order, res);
// 中序遍历
if (order == "in")
res.Add(Val(i).Value);
Dfs(Right(i), order, res);
DFS(Right(i), order, res);
// 后序遍历
if (order == "post")
res.Add(Val(i).Value);
@@ -75,21 +75,21 @@ public class ArrayBinaryTree {
/* 前序遍历 */
public List<int> PreOrder() {
List<int> res = new();
Dfs(0, "pre", res);
DFS(0, "pre", res);
return res;
}
/* 中序遍历 */
public List<int> InOrder() {
List<int> res = new();
Dfs(0, "in", res);
DFS(0, "in", res);
return res;
}
/* 后序遍历 */
public List<int> PostOrder() {
List<int> res = new();
Dfs(0, "post", res);
DFS(0, "post", res);
return res;
}
}