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-24 12:06:07 +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,73 @@
+/**
+ * File: binary_tree_bfs.c
+ * Created Time: 2023-01-11
+ * Author: Reanon (793584285@qq.com)
+ */
+
+#include "../utils/common.h"
+
+#define MAX_SIZE 100
+
+/* Level-order traversal */
+int *levelOrder(TreeNode *root, int *size) {
+    /* Auxiliary queue */
+    int front, rear;
+    int index, *arr;
+    TreeNode *node;
+    TreeNode **queue;
+
+    /* Auxiliary queue */
+    queue = (TreeNode **)malloc(sizeof(TreeNode *) * MAX_SIZE);
+    // Queue pointer
+    front = 0, rear = 0;
+    // Add root node
+    queue[rear++] = root;
+    // Initialize a list to save the traversal sequence
+    /* Auxiliary array */
+    arr = (int *)malloc(sizeof(int) * MAX_SIZE);
+    // Array pointer
+    index = 0;
+    while (front < rear) {
+        // Dequeue
+        node = queue[front++];
+        // Save node value
+        arr[index++] = node->val;
+        if (node->left != NULL) {
+            // Left child node enqueue
+            queue[rear++] = node->left;
+        }
+        if (node->right != NULL) {
+            // Right child node enqueue
+            queue[rear++] = node->right;
+        }
+    }
+    // Update array length value
+    *size = index;
+    arr = realloc(arr, sizeof(int) * (*size));
+
+    // Free auxiliary array space
+    free(queue);
+    return arr;
+}
+
+/* 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);
+
+    /* Level-order traversal */
+    // Need to pass array length
+    int *arr = levelOrder(root, &size);
+    printf("Level-order traversal node print sequence = ");
+    printArray(arr, size);
+
+    // Free memory
+    freeMemoryTree(root);
+    free(arr);
+    return 0;
+}