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

Retranslate the complete English edition from Simplified Chinese (#2010)

Browse Source 
* Retranslate the complete English edition from Simplified Chinese

* Polish three English explanations after reader-focused review
This commit is contained in:
Yudong Jin
2026-10-31 03:35:51 +08:00
committed by GitHub
parent ef46e2ed95
commit 14c314c08c
1502 changed files with 29459 additions and 23517 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -10,14 +10,14 @@ import utils.*;
import java.util.*;
public class binary_tree_dfs {
// Initialize list for storing traversal sequence
// Initialize a list to store the traversal sequence
static ArrayList<Integer> list = new ArrayList<>();
/* Preorder traversal */
static void preOrder(TreeNode root) {
if (root == null)
return;
// Visit priority: root node -> left subtree -> right subtree
// Visit order: root -> left subtree -> right subtree
list.add(root.val);
preOrder(root.left);
preOrder(root.right);
@@ -27,7 +27,7 @@ public class binary_tree_dfs {
static void inOrder(TreeNode root) {
if (root == null)
return;
// Visit priority: left subtree -> root node -> right subtree
// Visit order: left subtree -> root -> right subtree
inOrder(root.left);
list.add(root.val);
inOrder(root.right);
@@ -37,32 +37,32 @@ public class binary_tree_dfs {
static void postOrder(TreeNode root) {
if (root == null)
return;
// Visit priority: left subtree -> right subtree -> root node
// Visit order: left subtree -> right subtree -> root
postOrder(root.left);
postOrder(root.right);
list.add(root.val);
}
public static void main(String[] args) {
/* Initialize binary tree */
// Here we use a function to generate a binary tree directly from an array
/* Initialize the binary tree */
// Use a helper function that builds 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");
System.out.println("\nInitialize the binary tree\n");
PrintUtil.printTree(root);
/* Preorder traversal */
list.clear();
preOrder(root);
System.out.println("\nPreorder traversal node print sequence = " + list);
System.out.println("\nNode sequence from preorder traversal = " + list);
/* Inorder traversal */
list.clear();
inOrder(root);
System.out.println("\nInorder traversal node print sequence = " + list);
System.out.println("\nNode sequence from inorder traversal = " + list);
/* Postorder traversal */
list.clear();
postOrder(root);
System.out.println("\nPostorder traversal node print sequence = " + list);
System.out.println("\nNode sequence from postorder traversal = " + list);
}
}