algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

Reformat the C# codes.

Browse Source 
Disable creating new line before open brace.
This commit is contained in:
krahets
2023-04-23 03:03:12 +08:00
parent ac6eece4f3
commit 73dcb4cea9
49 changed files with 561 additions and 1135 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
codes/csharp/chapter_tree/binary_tree_dfs.cs
View File

@ -9,13 +9,11 @@ using NUnit.Framework;
namespace hello_algo.chapter_tree;
public class binary_tree_dfs
{
public class binary_tree_dfs {
List<int> list = new();
/* 前序遍历 */
void preOrder(TreeNode? root)
{
void preOrder(TreeNode? root) {
if (root == null) return;
// 访问优先级：根节点 -> 左子树 -> 右子树
list.Add(root.val);
@ -24,8 +22,7 @@ public class binary_tree_dfs
}
/* 中序遍历 */
void inOrder(TreeNode? root)
{
void inOrder(TreeNode? root) {
if (root == null) return;
// 访问优先级：左子树 -> 根节点 -> 右子树
inOrder(root.left);
@ -34,8 +31,7 @@ public class binary_tree_dfs
}
/* 后序遍历 */
void postOrder(TreeNode? root)
{
void postOrder(TreeNode? root) {
if (root == null) return;
// 访问优先级：左子树 -> 右子树 -> 根节点
postOrder(root.left);
@ -44,8 +40,7 @@ public class binary_tree_dfs
}
[Test]
public void Test()
{
public void Test() {
/* 初始化二叉树 */
// 这里借助了一个从数组直接生成二叉树的函数
TreeNode? root = TreeNode.ListToTree(new List<int?> { 1, 2, 3, 4, 5, 6, 7 });