diff --git a/homework4/test1.cpp b/homework4/test1.cpp
index ac5a0c0..2e81d16 100644
--- a/homework4/test1.cpp
+++ b/homework4/test1.cpp
@@ -1,5 +1,5 @@
 /*
- * 二叉树采用二叉链存储结构存放，结点值为int 类型，设计一个递归算法求二叉树 bt 中所有叶子结点值之和
+ * 浜屽弶鏍戦噰鐢ㄤ簩鍙夐摼瀛樺偍缁撴瀯瀛樻斁锛岀粨鐐瑰�间负int 绫诲瀷锛岃璁′竴涓�掑綊绠楁硶姹備簩鍙夋爲 bt 涓墍鏈夊彾瀛愮粨鐐瑰�间箣鍜�
  */
 #include<iostream>
 #include"BiTree.h"
@@ -23,7 +23,7 @@ int main()
 
     BiTree* root = createTreeFromArray(testValues, size);
 
-    cout << "树结构为" << endl << root->toString() << endl;
-    cout << "叶子节点数据总和: " << BiTree::sum_leaf(root) << endl;
+    cout << "鏍戠粨鏋勪负" << endl << root->toString() << endl;
+    cout << "鍙跺瓙鑺傜偣鏁版嵁鎬诲拰: " << BiTree::sum_leaf(root) << endl;
     return 0;
 }