CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-02-11 06:35:39 +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

42
en/codes/java/chapter_tree/binary_search_tree.java
View File

@@ -26,7 +26,7 @@ class BinarySearchTree {
/* Search node */
public TreeNode search(int num) {
TreeNode cur = root;
// Loop find, break after passing leaf nodes
// Loop search, exit after passing leaf node
while (cur != null) {
// Target node is in cur's right subtree
if (cur.val < num)
@@ -34,7 +34,7 @@ class BinarySearchTree {
// Target node is in cur's left subtree
else if (cur.val > num)
cur = cur.left;
// Found target node, break loop
// Found target node, exit loop
else
break;
}
@@ -50,9 +50,9 @@ class BinarySearchTree {
return;
}
TreeNode cur = root, pre = null;
// Loop find, break after passing leaf nodes
// Loop search, exit after passing leaf node
while (cur != null) {
// Found duplicate node, thus return
// Found duplicate node, return directly
if (cur.val == num)
return;
pre = cur;
@@ -73,49 +73,49 @@ class BinarySearchTree {
/* Remove node */
public void remove(int num) {
// If tree is empty, return
// If tree is empty, return directly
if (root == null)
return;
TreeNode cur = root, pre = null;
// Loop find, break after passing leaf nodes
// Loop search, exit after passing leaf node
while (cur != null) {
// Found node to be removed, break loop
// Found node to delete, exit loop
if (cur.val == num)
break;
pre = cur;
// Node to be removed is in cur's right subtree
// Node to delete is in cur's right subtree
if (cur.val < num)
cur = cur.right;
// Node to be removed is in cur's left subtree
// Node to delete is in cur's left subtree
else
cur = cur.left;
}
// If no node to be removed, return
// 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 the number of child nodes = 0/1, child = null/that child node
// When number of child nodes = 0 / 1, child = null / that child node
TreeNode child = cur.left != null ? cur.left : cur.right;
// Remove node cur
// Delete node cur
if (cur != root) {
if (pre.left == cur)
pre.left = child;
else
pre.right = child;
} else {
// If the removed node is the root, reassign the root
// If deleted node is root node, reassign root node
root = child;
}
}
// Number of child nodes = 2
else {
// Get the next node in in-order traversal of cur
// Get next node of cur in inorder traversal
TreeNode tmp = cur.right;
while (tmp.left != null) {
tmp = tmp.left;
}
// Recursively remove node tmp
// Recursively delete node tmp
remove(tmp.val);
// Replace cur with tmp
cur.val = tmp.val;
@@ -127,7 +127,7 @@ public class binary_search_tree {
public static void main(String[] args) {
/* Initialize binary search tree */
BinarySearchTree bst = new BinarySearchTree();
// Note that different insertion orders can result in various tree structures. This particular sequence creates a perfect binary tree
// 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 };
for (int num : nums) {
bst.insert(num);
@@ -137,22 +137,22 @@ public class binary_search_tree {
/* Search node */
TreeNode node = bst.search(7);
System.out.println("\nThe found node object is " + node + ", node value = " + node.val);
System.out.println("\nFound node object is " + node + ", node value = " + node.val);
/* Insert node */
bst.insert(16);
System.out.println("\nAfter inserting node 16, the binary tree is\n");
System.out.println("\nAfter inserting node 16, binary tree is\n");
PrintUtil.printTree(bst.getRoot());
/* Remove node */
bst.remove(1);
System.out.println("\nAfter removing node 1, the binary tree is\n");
System.out.println("\nAfter removing node 1, binary tree is\n");
PrintUtil.printTree(bst.getRoot());
bst.remove(2);
System.out.println("\nAfter removing node 2, the binary tree is\n");
System.out.println("\nAfter removing node 2, binary tree is\n");
PrintUtil.printTree(bst.getRoot());
bst.remove(4);
System.out.println("\nAfter removing node 4, the binary tree is\n");
System.out.println("\nAfter removing node 4, binary tree is\n");
PrintUtil.printTree(bst.getRoot());
}
}