Translate all code to English (#1836)

* 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
2026-07-21 02:56:11 +00:00 · 2025-12-31 07:44:52 +08:00
parent 45e1295241
commit 2778a6f9c7
1284 changed files with 71557 additions and 3275 deletions
@@ -0,0 +1,75 @@
+/**
+ * File: binary_tree_dfs.c
+ * Created Time: 2023-01-11
+ * Author: Reanon (793584285@qq.com)
+ */
+
+#include "../utils/common.h"
+
+#define MAX_SIZE 100
+
+// Auxiliary array for storing traversal sequence
+int arr[MAX_SIZE];
+
+/* Preorder traversal */
+void preOrder(TreeNode *root, int *size) {
+    if (root == NULL)
+        return;
+    // Visit priority: root node -> left subtree -> right subtree
+    arr[(*size)++] = root->val;
+    preOrder(root->left, size);
+    preOrder(root->right, size);
+}
+
+/* Inorder traversal */
+void inOrder(TreeNode *root, int *size) {
+    if (root == NULL)
+        return;
+    // Visit priority: left subtree -> root node -> right subtree
+    inOrder(root->left, size);
+    arr[(*size)++] = root->val;
+    inOrder(root->right, size);
+}
+
+/* Postorder traversal */
+void postOrder(TreeNode *root, int *size) {
+    if (root == NULL)
+        return;
+    // Visit priority: left subtree -> right subtree -> root node
+    postOrder(root->left, size);
+    postOrder(root->right, size);
+    arr[(*size)++] = root->val;
+}
+
+/* Driver Code */
+int main() {
+    /* Initialize binary tree */
+    // Here we use a function to generate a binary tree directly from an array
+    int nums[] = {1, 2, 3, 4, 5, 6, 7};
+    int size = sizeof(nums) / sizeof(int);
+    TreeNode *root = arrayToTree(nums, size);
+    printf("Initialize binary tree\n");
+    printTree(root);
+
+    /* Preorder traversal */
+    // Initialize auxiliary array
+    size = 0;
+    preOrder(root, &size);
+    printf("Pre-order traversal node print sequence = ");
+    printArray(arr, size);
+
+    /* Inorder traversal */
+    size = 0;
+    inOrder(root, &size);
+    printf("In-order traversal node print sequence = ");
+    printArray(arr, size);
+
+    /* Postorder traversal */
+    size = 0;
+    postOrder(root, &size);
+    printf("Post-order traversal node print sequence = ");
+    printArray(arr, size);
+
+    freeMemoryTree(root);
+    return 0;
+}