CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-05 19:50:25 +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

10
en/codes/python/chapter_tree/binary_tree.py
View File

@@ -14,13 +14,13 @@ from modules import TreeNode, print_tree
"""Driver Code"""
if __name__ == "__main__":
# Initialize binary tree
# Initialize node
# Initialize nodes
n1 = TreeNode(val=1)
n2 = TreeNode(val=2)
n3 = TreeNode(val=3)
n4 = TreeNode(val=4)
n5 = TreeNode(val=5)
# Construct node references (pointers)
# Build references (pointers) between nodes
n1.left = n2
n1.right = n3
n2.left = n4
@@ -28,14 +28,14 @@ if __name__ == "__main__":
print("\nInitialize binary tree\n")
print_tree(n1)
# Insert and remove nodes
# Insert and delete nodes
P = TreeNode(0)
# Insert node P between n1 -> n2
n1.left = P
P.left = n2
print("\nAfter inserting node P\n")
print_tree(n1)
# Remove node
# Delete node
n1.left = n2
print("\nAfter removing node P\n")
print("\nAfter deleting node P\n")
print_tree(n1)