xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-17 09:16:07 +00: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
docs/chapter_tree/binary_search_tree.md
+4 -105
View File
@@ -98,23 +98,7 @@ comments: true
=== "C#"
```csharp title="binary_search_tree.cs"
/* 查找结点 */
TreeNode? search(int num)
{
TreeNode? cur = root;
// 循环查找，越过叶结点后跳出
while (cur != null)
{
// 目标结点在 cur 的右子树中
if (cur.val < num) cur = cur.right;
// 目标结点在 cur 的左子树中
else if (cur.val > num) cur = cur.left;
// 找到目标结点，跳出循环
else break;
}
// 返回目标结点
return cur;
}
[class]{BinarySearchTree}-[func]{search}
```
=== "Swift"
@@ -214,33 +198,7 @@ comments: true
=== "C#"
```csharp title="binary_search_tree.cs"
/* 插入结点 */
TreeNode? insert(int num)
{
// 若树为空，直接提前返回
if (root == null) return null;
TreeNode? cur = root, pre = null;
// 循环查找，越过叶结点后跳出
while (cur != null)
{
// 找到重复结点，直接返回
if (cur.val == num) return null;
pre = cur;
// 插入位置在 cur 的右子树中
if (cur.val < num) cur = cur.right;
// 插入位置在 cur 的左子树中
else cur = cur.left;
}
// 插入结点 val
TreeNode node = new TreeNode(num);
if (pre != null)
{
if (pre.val < num) pre.right = node;
else pre.left = node;
}
return node;
}
[class]{BinarySearchTree}-[func]{insert}
```
=== "Swift"
@@ -411,68 +369,9 @@ comments: true
=== "C#"
```csharp title="binary_search_tree.cs"
/* 删除结点 */
TreeNode? remove(int num)
{
// 若树为空，直接提前返回
if (root == null) return null;
TreeNode? cur = root, pre = null;
// 循环查找，越过叶结点后跳出
while (cur != null)
{
// 找到待删除结点，跳出循环
if (cur.val == num) break;
pre = cur;
// 待删除结点在 cur 的右子树中
if (cur.val < num) cur = cur.right;
// 待删除结点在 cur 的左子树中
else cur = cur.left;
}
// 若无待删除结点，则直接返回
if (cur == null || pre == null) return null;
// 子结点数量 = 0 or 1
if (cur.left == null || cur.right == null)
{
// 当子结点数量 = 0 / 1 时， child = null / 该子结点
TreeNode? child = cur.left != null ? cur.left : cur.right;
// 删除结点 cur
if (pre.left == cur)
{
pre.left = child;
}
else
{
pre.right = child;
}
}
// 子结点数量 = 2
else
{
// 获取中序遍历中 cur 的下一个结点
TreeNode? nex = getInOrderNext(cur.right);
if (nex != null)
{
int tmp = nex.val;
// 递归删除结点 nex
remove(nex.val);
// 将 nex 的值复制给 cur
cur.val = tmp;
}
}
return cur;
}
[class]{BinarySearchTree}-[func]{remove}
/* 获取中序遍历中的下一个结点（仅适用于 root 有左子结点的情况） */
private TreeNode? getInOrderNext(TreeNode? root)
{
if (root == null) return root;
// 循环访问左子结点，直到叶结点时为最小结点，跳出
while (root.left != null)
{
root = root.left;
}
return root;
}
[class]{BinarySearchTree}-[func]{getInOrderNext}
```
=== "Swift"