CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-23 18:11:45 +08:00
Code Issues Packages Projects Releases Wiki Activity

Translate all code to English (#1836)

Browse Source 
* Review the EN heading format.

* Fix pythontutor headings.

* Fix pythontutor headings.

* bug fixes

* Fix headings in **/summary.md

* Revisit the CN-to-EN translation for Python code using Claude-4.5

* Revisit the CN-to-EN translation for Java code using Claude-4.5

* Revisit the CN-to-EN translation for Cpp code using Claude-4.5.

* Fix the dictionary.

* Fix cpp code translation for the multipart strings.

* Translate Go code to English.

* Update workflows to test EN code.

* Add EN translation for C.

* Add EN translation for CSharp.

* Add EN translation for Swift.

* Trigger the CI check.

* Revert.

* Update en/hash_map.md

* Add the EN version of Dart code.

* Add the EN version of Kotlin code.

* Add missing code files.

* Add the EN version of JavaScript code.

* Add the EN version of TypeScript code.

* Fix the workflows.

* Add the EN version of Ruby code.

* Add the EN version of Rust code.

* Update the CI check for the English version  code.

* Update Python CI check.

* Fix cmakelists for en/C code.

* Fix Ruby comments
This commit is contained in:
Yudong Jin
2025-12-31 07:44:52 +08:00
committed by GitHub
parent 45e1295241
commit 2778a6f9c7
1284 changed files with 71557 additions and 3275 deletions
Download Patch File Download Diff File Expand all files Collapse all files

160
en/codes/csharp/chapter_tree/binary_search_tree.cs Normal file
View File

@@ -0,0 +1,160 @@
/**
* File: binary_search_tree.cs
* Created Time: 2022-12-23
* Author: haptear (haptear@hotmail.com)
*/
namespace hello_algo.chapter_tree;
class BinarySearchTree {
TreeNode? root;
public BinarySearchTree() {
// Initialize empty tree
root = null;
}
/* Get binary tree root node */
public TreeNode? GetRoot() {
return root;
}
/* Search node */
public TreeNode? Search(int num) {
TreeNode? cur = root;
// Loop search, exit after passing leaf node
while (cur != null) {
// Target node is in cur's right subtree
if (cur.val < num) cur =
cur.right;
// Target node is in cur's left subtree
else if (cur.val > num)
cur = cur.left;
// Found target node, exit loop
else
break;
}
// Return target node
return cur;
}
/* Insert node */
public void Insert(int num) {
// If tree is empty, initialize root node
if (root == null) {
root = new TreeNode(num);
return;
}
TreeNode? cur = root, pre = null;
// Loop search, exit after passing leaf node
while (cur != null) {
// Found duplicate node, return directly
if (cur.val == num)
return;
pre = cur;
// Insertion position is in cur's right subtree
if (cur.val < num)
cur = cur.right;
// Insertion position is in cur's left subtree
else
cur = cur.left;
}
// Insert node
TreeNode node = new(num);
if (pre != null) {
if (pre.val < num)
pre.right = node;
else
pre.left = node;
}
}
/* Remove node */
public void Remove(int num) {
// If tree is empty, return directly
if (root == null)
return;
TreeNode? cur = root, pre = null;
// Loop search, exit after passing leaf node
while (cur != null) {
// Found node to delete, exit loop
if (cur.val == num)
break;
pre = cur;
// Node to delete is in cur's right subtree
if (cur.val < num)
cur = cur.right;
// Node to delete is in cur's left subtree
else
cur = cur.left;
}
// If no node to delete, return directly
if (cur == null)
return;
// Number of child nodes = 0 or 1
if (cur.left == null || cur.right == null) {
// When number of child nodes = 0 / 1, child = null / that child node
TreeNode? child = cur.left ?? cur.right;
// Delete node cur
if (cur != root) {
if (pre!.left == cur)
pre.left = child;
else
pre.right = child;
} else {
// If deleted node is root node, reassign root node
root = child;
}
}
// Number of child nodes = 2
else {
// Get next node of cur in inorder traversal
TreeNode? tmp = cur.right;
while (tmp.left != null) {
tmp = tmp.left;
}
// Recursively delete node tmp
Remove(tmp.val!.Value);
// Replace cur with tmp
cur.val = tmp.val;
}
}
}
public class binary_search_tree {
[Test]
public void Test() {
/* Initialize binary search tree */
BinarySearchTree bst = new();
// Please note that different insertion orders will generate different binary trees, this sequence can generate a perfect binary tree
int[] nums = [8, 4, 12, 2, 6, 10, 14, 1, 3, 5, 7, 9, 11, 13, 15];
foreach (int num in nums) {
bst.Insert(num);
}
Console.WriteLine("\nInitialized binary tree is\n");
PrintUtil.PrintTree(bst.GetRoot());
/* Search node */
TreeNode? node = bst.Search(7);
Console.WriteLine("\nFound node object is " + node + ", node value = " + node?.val);
/* Insert node */
bst.Insert(16);
Console.WriteLine("\nAfter inserting node 16, binary tree is\n");
PrintUtil.PrintTree(bst.GetRoot());
/* Remove node */
bst.Remove(1);
Console.WriteLine("\nAfter removing node 1, binary tree is\n");
PrintUtil.PrintTree(bst.GetRoot());
bst.Remove(2);
Console.WriteLine("\nAfter removing node 2, binary tree is\n");
PrintUtil.PrintTree(bst.GetRoot());
bst.Remove(4);
Console.WriteLine("\nAfter removing node 4, binary tree is\n");
PrintUtil.PrintTree(bst.GetRoot());
}
}