第一题完成

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;
 }