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-09-03 21:57:14 +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,46 @@
+=begin
+File: build_tree.rb
+Created Time: 2024-05-13
+Author: Xuan Khoa Tu Nguyen (ngxktuzkai2000@gmail.com)
+=end
+
+require_relative '../utils/tree_node'
+require_relative '../utils/print_util'
+
+### Build binary tree: divide and conquer ###
+def dfs(preorder, inorder_map, i, l, r)
+  # Terminate when the subtree interval is empty
+  return if r - l < 0
+
+  # Initialize the root node
+  root = TreeNode.new(preorder[i])
+  # Query m to divide the left and right subtrees
+  m = inorder_map[preorder[i]]
+  # Subproblem: build the left subtree
+  root.left = dfs(preorder, inorder_map, i + 1, l, m - 1)
+  # Subproblem: build the right subtree
+  root.right = dfs(preorder, inorder_map, i + 1 + m - l, m + 1, r)
+
+  # Return the root node
+  root
+end
+
+### Build binary tree ###
+def build_tree(preorder, inorder)
+  # Initialize hash map, storing the mapping from inorder elements to indices
+  inorder_map = {}
+  inorder.each_with_index { |val, i| inorder_map[val] = i }
+  dfs(preorder, inorder_map, 0, 0, inorder.length - 1)
+end
+
+### Driver Code ###
+if __FILE__ == $0
+  preorder = [3, 9, 2, 1, 7]
+  inorder = [9, 3, 1, 2, 7]
+  puts "Pre-order traversal = #{preorder}"
+  puts "In-order traversal = #{inorder}"
+
+  root = build_tree(preorder, inorder)
+  puts "The constructed binary tree is:"
+  print_tree(root)
+end