mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-27 13:46:29 +08:00
f62256bee1
* Modify method name to PascalCase(array and linked list) * Modify method name to PascalCase(backtracking) * Modify method name to PascalCase(computational complexity) * Modify method name to PascalCase(divide and conquer) * Modify method name to PascalCase(dynamic programming) * Modify method name to PascalCase(graph) * Modify method name to PascalCase(greedy) * Modify method name to PascalCase(hashing) * Modify method name to PascalCase(heap) * Modify method name to PascalCase(searching) * Modify method name to PascalCase(sorting) * Modify method name to PascalCase(stack and queue) * Modify method name to PascalCase(tree) * local check
39 lines
1,013 B
C#
39 lines
1,013 B
C#
/**
|
|
* File: binary_tree.cs
|
|
* Created Time: 2022-12-23
|
|
* Author: haptear (haptear@hotmail.com)
|
|
*/
|
|
|
|
namespace hello_algo.chapter_tree;
|
|
|
|
public class binary_tree {
|
|
[Test]
|
|
public void Test() {
|
|
/* 初始化二叉树 */
|
|
// 初始化节点
|
|
TreeNode n1 = new(1);
|
|
TreeNode n2 = new(2);
|
|
TreeNode n3 = new(3);
|
|
TreeNode n4 = new(4);
|
|
TreeNode n5 = new(5);
|
|
// 构建引用指向(即指针)
|
|
n1.left = n2;
|
|
n1.right = n3;
|
|
n2.left = n4;
|
|
n2.right = n5;
|
|
Console.WriteLine("\n初始化二叉树\n");
|
|
PrintUtil.PrintTree(n1);
|
|
|
|
/* 插入与删除节点 */
|
|
TreeNode P = new(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);
|
|
}
|
|
}
|