函数分离

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