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

Add build scripts for C# and

Browse Source 
unify the coding style.
This commit is contained in:
krahets
2023-02-08 22:18:02 +08:00
parent 38751cc5f5
commit 6dc21691ed
63 changed files with 2703 additions and 3911 deletions
Download Patch File Download Diff File Expand all files Collapse all files

64
codes/csharp/chapter_tree/binary_tree.cs
View File

@ -7,40 +7,38 @@
using hello_algo.include;
using NUnit.Framework;
namespace hello_algo.chapter_tree
namespace hello_algo.chapter_tree;
public class binary_tree
{
public class binary_tree
[Test]
public void Test()
{
[Test]
public void Test()
{
/* 初始化二叉树 */
// 初始化结点
TreeNode n1 = new TreeNode(1);
TreeNode n2 = new TreeNode(2);
TreeNode n3 = new TreeNode(3);
TreeNode n4 = new TreeNode(4);
TreeNode n5 = new TreeNode(5);
// 构建引用指向（即指针）
n1.left = n2;
n1.right = n3;
n2.left = n4;
n2.right = n5;
Console.WriteLine("\n初始化二叉树\n");
PrintUtil.PrintTree(n1);
/* 初始化二叉树 */
// 初始化结点
TreeNode n1 = new TreeNode(1);
TreeNode n2 = new TreeNode(2);
TreeNode n3 = new TreeNode(3);
TreeNode n4 = new TreeNode(4);
TreeNode n5 = new TreeNode(5);
// 构建引用指向（即指针）
n1.left = n2;
n1.right = n3;
n2.left = n4;
n2.right = n5;
Console.WriteLine("\n初始化二叉树\n");
PrintUtil.PrintTree(n1);
/* 插入与删除结点 */
TreeNode P = new TreeNode(0);
// 在 n1 -> n2 中间插入结点 P
n1.left = P;
P.left = n2;
Console.WriteLine("\n插入结点 P 后\n");
PrintUtil.PrintTree(n1);
// 删除结点 P
n1.left = n2;
Console.WriteLine("\n删除结点 P 后\n");
PrintUtil.PrintTree(n1);
}
/* 插入与删除结点 */
TreeNode P = new TreeNode(0);
// 在 n1 -> n2 中间插入结点 P
n1.left = P;
P.left = n2;
Console.WriteLine("\n插入结点 P 后\n");
PrintUtil.PrintTree(n1);
// 删除结点 P
n1.left = n2;
Console.WriteLine("\n删除结点 P 后\n");
PrintUtil.PrintTree(n1);
}
}
}