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-17 22:10: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,173 @@
+/**
+ * File: binary_search_tree.swift
+ * Created Time: 2023-01-26
+ * Author: nuomi1 (nuomi1@qq.com)
+ */
+
+import utils
+
+/* Binary search tree */
+class BinarySearchTree {
+    private var root: TreeNode?
+
+    /* Constructor */
+    init() {
+        // Initialize empty tree
+        root = nil
+    }
+
+    /* Get binary tree root node */
+    func getRoot() -> TreeNode? {
+        root
+    }
+
+    /* Search node */
+    func search(num: Int) -> TreeNode? {
+        var cur = root
+        // Loop search, exit after passing leaf node
+        while cur != nil {
+            // Target node is in cur's right subtree
+            if cur!.val < num {
+                cur = cur?.right
+            }
+            // Target node is in cur's left subtree
+            else if cur!.val > num {
+                cur = cur?.left
+            }
+            // Found target node, exit loop
+            else {
+                break
+            }
+        }
+        // Return target node
+        return cur
+    }
+
+    /* Insert node */
+    func insert(num: Int) {
+        // If tree is empty, initialize root node
+        if root == nil {
+            root = TreeNode(x: num)
+            return
+        }
+        var cur = root
+        var pre: TreeNode?
+        // Loop search, exit after passing leaf node
+        while cur != nil {
+            // Found duplicate node, return directly
+            if cur!.val == num {
+                return
+            }
+            pre = cur
+            // Insertion position is in cur's right subtree
+            if cur!.val < num {
+                cur = cur?.right
+            }
+            // Insertion position is in cur's left subtree
+            else {
+                cur = cur?.left
+            }
+        }
+        // Insert node
+        let node = TreeNode(x: num)
+        if pre!.val < num {
+            pre?.right = node
+        } else {
+            pre?.left = node
+        }
+    }
+
+    /* Remove node */
+    func remove(num: Int) {
+        // If tree is empty, return directly
+        if root == nil {
+            return
+        }
+        var cur = root
+        var pre: TreeNode?
+        // Loop search, exit after passing leaf node
+        while cur != nil {
+            // Found node to delete, exit loop
+            if cur!.val == num {
+                break
+            }
+            pre = cur
+            // Node to delete is in cur's right subtree
+            if cur!.val < num {
+                cur = cur?.right
+            }
+            // Node to delete is in cur's left subtree
+            else {
+                cur = cur?.left
+            }
+        }
+        // If no node to delete, return directly
+        if cur == nil {
+            return
+        }
+        // Number of child nodes = 0 or 1
+        if cur?.left == nil || cur?.right == nil {
+            // When number of child nodes = 0 / 1, child = null / that child node
+            let child = cur?.left ?? cur?.right
+            // Delete node cur
+            if cur !== root {
+                if pre?.left === cur {
+                    pre?.left = child
+                } else {
+                    pre?.right = child
+                }
+            } else {
+                // If deleted node is root node, reassign root node
+                root = child
+            }
+        }
+        // Number of child nodes = 2
+        else {
+            // Get next node of cur in inorder traversal
+            var tmp = cur?.right
+            while tmp?.left != nil {
+                tmp = tmp?.left
+            }
+            // Recursively delete node tmp
+            remove(num: tmp!.val)
+            // Replace cur with tmp
+            cur?.val = tmp!.val
+        }
+    }
+}
+
+@main
+enum _BinarySearchTree {
+    /* Driver Code */
+    static func main() {
+        /* Initialize binary search tree */
+        let bst = BinarySearchTree()
+        // Please note that different insertion orders will generate different binary trees, this sequence can generate a perfect binary tree
+        let nums = [8, 4, 12, 2, 6, 10, 14, 1, 3, 5, 7, 9, 11, 13, 15]
+        for num in nums {
+            bst.insert(num: num)
+        }
+        print("\nInitialized binary tree is\n")
+        PrintUtil.printTree(root: bst.getRoot())
+
+        /* Search node */
+        let node = bst.search(num: 7)
+        print("\nFound node object is \(node!), node value = \(node!.val)")
+
+        /* Insert node */
+        bst.insert(num: 16)
+        print("\nAfter inserting node 16, binary tree is\n")
+        PrintUtil.printTree(root: bst.getRoot())
+
+        /* Remove node */
+        bst.remove(num: 1)
+        print("\nAfter removing node 1, binary tree is\n")
+        PrintUtil.printTree(root: bst.getRoot())
+        bst.remove(num: 2)
+        print("\nAfter removing node 2, binary tree is\n")
+        PrintUtil.printTree(root: bst.getRoot())
+        bst.remove(num: 4)
+        print("\nAfter removing node 4, binary tree is\n")
+        PrintUtil.printTree(root: bst.getRoot())
+    }
+}