函数分离

homework4/BiTree.cpp

@@ -24,3 +24,22 @@ int BiTree::sum_leaf(BiTree *bt) {
     return sum_leaf(bt->left)+sum_leaf(bt->right);
 }
 
+BiTree* BiTree::createNode(int data) {
+    BiTree* newNode = new BiTree();
+    newNode->data = data;
+    newNode->left = nullptr;
+    newNode->right = nullptr;
+    return newNode;
+}
+
+void BiTree::insertNode(BiTree*& bt, int value) {
+    if (bt == nullptr) {
+        bt = createNode(value);
+    } else {
+        if (value < bt->data) {
+            insertNode(bt->left, value);
+        } else if (value > bt->data) {
+            insertNode(bt->right, value);
+        }
+    }
+}

homework4/BiTree.h

@@ -12,6 +12,8 @@ public:
     static bool is_empty(BiTree *bt);
     static bool is_leaf(BiTree *bt);
     static int sum_leaf(BiTree *bt);
+    static BiTree* createNode(int data);
+    static void insertNode(BiTree*& bt, int value);
 };
 
 

homework4/test1.cpp

@@ -2,30 +2,12 @@
 #include"BiTree.h"
 using namespace std;
 
-BiTree* createNode(int data) {
-    BiTree* newNode = new BiTree();
-    newNode->data = data;
-    newNode->left = nullptr;
-    newNode->right = nullptr;
-    return newNode;
-}
 
-void insertNode(BiTree*& bt, int value) {
-    if (bt == nullptr) {
-        bt = createNode(value);
-    } else {
-        if (value < bt->data) {
-            insertNode(bt->left, value);
-        } else if (value > bt->data) {
-            insertNode(bt->right, value);
-        }
-    }
-}
 
 BiTree* createTreeFromArray(const int* values, int size) {
     BiTree* root = nullptr;
     for (int i = 0; i < size; ++i) {
-        insertNode(root, values[i]);
+        BiTree::insertNode(root, values[i]);
     }
     return root;
 }