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

20
en/codes/python/chapter_tree/binary_tree_dfs.py
View File

@@ -12,7 +12,7 @@ from modules import TreeNode, list_to_tree, print_tree
def pre_order(root: TreeNode | None):
"""Pre-order traversal"""
"""Preorder traversal"""
if root is None:
return
# Visit priority: root node -> left subtree -> right subtree
@@ -22,7 +22,7 @@ def pre_order(root: TreeNode | None):
def in_order(root: TreeNode | None):
"""In-order traversal"""
"""Inorder traversal"""
if root is None:
return
# Visit priority: left subtree -> root node -> right subtree
@@ -32,7 +32,7 @@ def in_order(root: TreeNode | None):
def post_order(root: TreeNode | None):
"""Post-order traversal"""
"""Postorder traversal"""
if root is None:
return
# Visit priority: left subtree -> right subtree -> root node
@@ -44,22 +44,22 @@ def post_order(root: TreeNode | None):
"""Driver Code"""
if __name__ == "__main__":
# 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
root = list_to_tree(arr=[1, 2, 3, 4, 5, 6, 7])
print("\nInitialize binary tree\n")
print_tree(root)
# Pre-order traversal
# Preorder traversal
res = []
pre_order(root)
print("\nPrint sequence of nodes from pre-order traversal = ", res)
print("\nPreorder traversal node print sequence = ", res)
# In-order traversal
# Inorder traversal
res.clear()
in_order(root)
print("\nPrint sequence of nodes from in-order traversal = ", res)
print("\nInorder traversal node print sequence = ", res)
# Post-order traversal
# Postorder traversal
res.clear()
post_order(root)
print("\nPrint sequence of nodes from post-order traversal = ", res)
print("\nPostorder traversal node print sequence = ", res)