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

16
en/codes/java/chapter_tree/binary_tree.java
View File

@@ -10,31 +10,31 @@ import utils.*;
public class binary_tree {
public static void main(String[] args) {
/* Initialize binary tree */
// Initialize nodes
/* Initialize the binary tree */
// Initialize the nodes
TreeNode n1 = new TreeNode(1);
TreeNode n2 = new TreeNode(2);
TreeNode n3 = new TreeNode(3);
TreeNode n4 = new TreeNode(4);
TreeNode n5 = new TreeNode(5);
// Build references (pointers) between nodes
// Set up references (pointers) between the nodes
n1.left = n2;
n1.right = n3;
n2.left = n4;
n2.right = n5;
System.out.println("\nInitialize binary tree\n");
System.out.println("\nInitialize the binary tree\n");
PrintUtil.printTree(n1);
/* Insert node P between n1 -> n2 */
/* Insert and remove nodes */
TreeNode P = new TreeNode(0);
// Delete node
// Insert node P between n1 and n2 in n1 -> n2
n1.left = P;
P.left = n2;
System.out.println("\nAfter inserting node P\n");
System.out.println("\nAfter inserting node P:\n");
PrintUtil.printTree(n1);
// Remove node P
n1.left = n2;
System.out.println("\nAfter removing node P\n");
System.out.println("\nAfter removing node P:\n");
PrintUtil.printTree(n1);
}
}