From 857c54cde050fb067fa309301983dcedfe1642f7 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E5=BE=A1=E5=9D=82=E6=98=B4?= <gugugulaocuchen@gmail.com>
Date: Wed, 20 Nov 2024 21:59:08 +0800
Subject: [PATCH] =?UTF-8?q?=E7=AC=AC=E4=B8=80=E9=A2=98=E5=AE=8C=E6=88=90?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 homework4/test1.cpp | 23 ++++++++++++++++-------
 1 file changed, 16 insertions(+), 7 deletions(-)

diff --git a/homework4/test1.cpp b/homework4/test1.cpp
index 9b4b27e..9436abf 100644
--- a/homework4/test1.cpp
+++ b/homework4/test1.cpp
@@ -10,23 +10,32 @@ BiTree* createNode(int data) {
     return newNode;
 }
 
-void createTree(BiTree*& bt, int value) {
+void insertNode(BiTree*& bt, int value) {
     if (bt == nullptr) {
         bt = createNode(value);
     } else {
         if (value < bt->data) {
-            createTree(bt->left, value);
+            insertNode(bt->left, value);
         } else if (value > bt->data) {
-            createTree(bt->right, value);
+            insertNode(bt->right, value);
         }
     }
 }
 
-int main() {
+BiTree* createTreeFromArray(const int* values, int size) {
     BiTree* root = nullptr;
-    for (int i = 0; i < 10; i++) {
-        createTree(root, i);
+    for (int i = 0; i < size; ++i) {
+        insertNode(root, values[i]);
     }
-    cout << BiTree::sum_leaf(root) << endl;
+    return root;
+}
+
+int main() {
+    int testValues[] = {7, 3, 10, 1, 5, 9, 12};
+    int size = sizeof(testValues) / sizeof(testValues[0]);
+
+    BiTree* root = createTreeFromArray(testValues, size);
+
+    cout << "Sum of leaf nodes: " << BiTree::sum_leaf(root) << endl;
     return 0;
 }
\ No newline at end of file