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-08-15 05:00:59 +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,36 @@
+=begin
+File: binary_tree_bfs.rb
+Created Time: 2024-04-18
+Author: Xuan Khoa Tu Nguyen (ngxktuzkai2000@gmail.com)
+=end
+
+require_relative '../utils/tree_node'
+require_relative '../utils/print_util'
+
+### Level-order traversal ###
+def level_order(root)
+  # Initialize queue, add root node
+  queue = [root]
+  # Initialize a list to save the traversal sequence
+  res = []
+  while !queue.empty?
+    node = queue.shift # Dequeue
+    res << node.val # Save node value
+    queue << node.left unless node.left.nil? # Left child node enqueue
+    queue << node.right unless node.right.nil? # Right child node enqueue
+  end
+  res
+end
+
+### Driver Code ###
+if __FILE__ == $0
+  # Initialize binary tree
+  # Here we use a function to generate a binary tree directly from an array
+  root = arr_to_tree([1, 2, 3, 4, 5, 6, 7])
+  puts "\nInitialize binary tree\n\n"
+  print_tree(root)
+
+  # Level-order traversal
+  res = level_order(root)
+  puts "\nLevel-order traversal node sequence = #{res}"
+end