algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-16 03:59:18 +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

84
codes/csharp/chapter_tree/avl_tree.cs
View File

@@ -10,27 +10,23 @@ using NUnit.Framework;
namespace hello_algo.chapter_tree;
/* AVL 树 */
class AVLTree
{
class AVLTree {
public TreeNode? root; // 根节点
/* 获取节点高度 */
public int height(TreeNode? node)
{
public int height(TreeNode? node) {
// 空节点高度为 -1 ，叶节点高度为 0
return node == null ? -1 : node.height;
}
/* 更新节点高度 */
private void updateHeight(TreeNode node)
{
private void updateHeight(TreeNode node) {
// 节点高度等于最高子树高度 + 1
node.height = Math.Max(height(node.left), height(node.right)) + 1;
}
/* 获取平衡因子 */
public int balanceFactor(TreeNode? node)
{
public int balanceFactor(TreeNode? node) {
// 空节点平衡因子为 0
if (node == null) return 0;
// 节点平衡因子 = 左子树高度 - 右子树高度
@@ -38,8 +34,7 @@ class AVLTree
}
/* 右旋操作 */
TreeNode? rightRotate(TreeNode? node)
{
TreeNode? rightRotate(TreeNode? node) {
TreeNode? child = node.left;
TreeNode? grandChild = child?.right;
// 以 child 为原点，将 node 向右旋转
@@ -53,8 +48,7 @@ class AVLTree
}
/* 左旋操作 */
TreeNode? leftRotate(TreeNode? node)
{
TreeNode? leftRotate(TreeNode? node) {
TreeNode? child = node.right;
TreeNode? grandChild = child?.left;
// 以 child 为原点，将 node 向左旋转
@@ -68,35 +62,26 @@ class AVLTree
}
/* 执行旋转操作，使该子树重新恢复平衡 */
TreeNode? rotate(TreeNode? node)
{
TreeNode? rotate(TreeNode? node) {
// 获取节点 node 的平衡因子
int balanceFactorInt = balanceFactor(node);
// 左偏树
if (balanceFactorInt > 1)
{
if (balanceFactor(node.left) >= 0)
{
if (balanceFactorInt > 1) {
if (balanceFactor(node.left) >= 0) {
// 右旋
return rightRotate(node);
}
else
{
} else {
// 先左旋后右旋
node.left = leftRotate(node?.left);
return rightRotate(node);
}
}
// 右偏树
if (balanceFactorInt < -1)
{
if (balanceFactor(node.right) <= 0)
{
if (balanceFactorInt < -1) {
if (balanceFactor(node.right) <= 0) {
// 左旋
return leftRotate(node);
}
else
{
} else {
// 先右旋后左旋
node.right = rightRotate(node?.right);
return leftRotate(node);
@@ -107,14 +92,12 @@ class AVLTree
}
/* 插入节点 */
public void insert(int val)
{
public void insert(int val) {
root = insertHelper(root, val);
}
/* 递归插入节点（辅助方法） */
private TreeNode? insertHelper(TreeNode? node, int val)
{
private TreeNode? insertHelper(TreeNode? node, int val) {
if (node == null) return new TreeNode(val);
/* 1. 查找插入位置，并插入节点 */
if (val < node.val)
@@ -131,24 +114,20 @@ class AVLTree
}
/* 删除节点 */
public void remove(int val)
{
public void remove(int val) {
root = removeHelper(root, val);
}
/* 递归删除节点（辅助方法） */
private TreeNode? removeHelper(TreeNode? node, int val)
{
private TreeNode? removeHelper(TreeNode? node, int val) {
if (node == null) return null;
/* 1. 查找节点，并删除之 */
if (val < node.val)
node.left = removeHelper(node.left, val);
else if (val > node.val)
node.right = removeHelper(node.right, val);
else
{
if (node.left == null || node.right == null)
{
else {
if (node.left == null || node.right == null) {
TreeNode? child = node.left != null ? node.left : node.right;
// 子节点数量 = 0 ，直接删除 node 并返回
if (child == null)
@@ -156,13 +135,10 @@ class AVLTree
// 子节点数量 = 1 ，直接删除 node
else
node = child;
}
else
{
} else {
// 子节点数量 = 2 ，则将中序遍历的下个节点删除，并用该节点替换当前节点
TreeNode? temp = node.right;
while (temp.left != null)
{
while (temp.left != null) {
temp = temp.left;
}
node.right = removeHelper(node.right, temp.val);
@@ -177,12 +153,10 @@ class AVLTree
}
/* 查找节点 */
public TreeNode? search(int val)
{
public TreeNode? search(int val) {
TreeNode? cur = root;
// 循环查找，越过叶节点后跳出
while (cur != null)
{
while (cur != null) {
// 目标节点在 cur 的右子树中
if (cur.val < val)
cur = cur.right;
@@ -198,25 +172,21 @@ class AVLTree
}
}
public class avl_tree
{
static void testInsert(AVLTree tree, int val)
{
public class avl_tree {
static void testInsert(AVLTree tree, int val) {
tree.insert(val);
Console.WriteLine("\n插入节点 " + val + " 后，AVL 树为");
PrintUtil.PrintTree(tree.root);
}
static void testRemove(AVLTree tree, int val)
{
static void testRemove(AVLTree tree, int val) {
tree.remove(val);
Console.WriteLine("\n删除节点 " + val + " 后，AVL 树为");
PrintUtil.PrintTree(tree.root);
}
[Test]
public void Test()
{
public void Test() {
/* 初始化空 AVL 树 */
AVLTree avlTree = new AVLTree();