From f4a6d2127c0aa4a491eaddf3f0657605b0552e76 Mon Sep 17 00:00:00 2001
From: Flamingo <flamingo@theplant.jp>
Date: Mon, 1 Jul 2024 15:10:46 +0800
Subject: [PATCH] fix: correct comment translation in binary_tree.md (#1406)

---
 en/docs/chapter_tree/binary_tree.md | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/en/docs/chapter_tree/binary_tree.md b/en/docs/chapter_tree/binary_tree.md
index ecc8d2b85..b855e1a82 100644
--- a/en/docs/chapter_tree/binary_tree.md
+++ b/en/docs/chapter_tree/binary_tree.md
@@ -57,7 +57,7 @@ A <u>binary tree</u> is a non-linear data structure that represents the hierarch
         Left  *TreeNode
         Right *TreeNode
     }
-    /* 构造方法 */
+    /* Constructor */
     func NewTreeNode(v int) *TreeNode {
         return &TreeNode{
             Left:  nil, // Pointer to left child node
@@ -141,7 +141,7 @@ A <u>binary tree</u> is a non-linear data structure that represents the hierarch
     }
 
     impl TreeNode {
-        /* 构造方法 */
+        /* Constructor */
         fn new(val: i32) -> Rc<RefCell<Self>> {
             Rc::new(RefCell::new(Self {
                 val,
@@ -158,12 +158,12 @@ A <u>binary tree</u> is a non-linear data structure that represents the hierarch
     /* Binary tree node */
     typedef struct TreeNode {
         int val;                // Node value
-        int height;             // 节点高度
+        int height;             // Node height
         struct TreeNode *left;  // Pointer to left child node
         struct TreeNode *right; // Pointer to right child node
     } TreeNode;
 
-    /* 构造函数 */
+    /* Constructor */
     TreeNode *newTreeNode(int val) {
         TreeNode *node;