CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-09 13:51:48 +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

22
en/codes/java/chapter_tree/binary_tree_dfs.java
View File

@@ -10,10 +10,10 @@ import utils.*;
import java.util.*;
public class binary_tree_dfs {
// Initialize the list for storing traversal sequences
// Initialize list for storing traversal sequence
static ArrayList<Integer> list = new ArrayList<>();
/* Pre-order traversal */
/* Preorder traversal */
static void preOrder(TreeNode root) {
if (root == null)
return;
@@ -23,7 +23,7 @@ public class binary_tree_dfs {
preOrder(root.right);
}
/* In-order traversal */
/* Inorder traversal */
static void inOrder(TreeNode root) {
if (root == null)
return;
@@ -33,7 +33,7 @@ public class binary_tree_dfs {
inOrder(root.right);
}
/* Post-order traversal */
/* Postorder traversal */
static void postOrder(TreeNode root) {
if (root == null)
return;
@@ -45,24 +45,24 @@ public class binary_tree_dfs {
public static void main(String[] args) {
/* Initialize binary tree */
// Use a specific function to convert an array into a binary tree
// Here we use a function to generate a binary tree directly from an array
TreeNode root = TreeNode.listToTree(Arrays.asList(1, 2, 3, 4, 5, 6, 7));
System.out.println("\nInitialize binary tree\n");
PrintUtil.printTree(root);
/* Pre-order traversal */
/* Preorder traversal */
list.clear();
preOrder(root);
System.out.println("\nPrint sequence of nodes from pre-order traversal = " + list);
System.out.println("\nPreorder traversal node print sequence = " + list);
/* In-order traversal */
/* Inorder traversal */
list.clear();
inOrder(root);
System.out.println("\nPrint sequence of nodes from in-order traversal = " + list);
System.out.println("\nInorder traversal node print sequence = " + list);
/* Post-order traversal */
/* Postorder traversal */
list.clear();
postOrder(root);
System.out.println("\nPrint sequence of nodes from post-order traversal = " + list);
System.out.println("\nPostorder traversal node print sequence = " + list);
}
}