初步实现（不知道对不对😭）

homework4/BiTree.cpp

@@ -1 +1,26 @@
 #include "BiTree.h"
+
+bool BiTree::is_empty(BiTree *bt) {
+    if(bt==nullptr) {
+        return true;
+    }
+    return false;
+}
+
+bool BiTree::is_leaf(BiTree *bt) {
+    if(bt->left==nullptr && bt->right==nullptr) {
+        return true;
+    }
+    return false;
+}
+
+int BiTree::sum_leaf(BiTree *bt) {
+    if(is_empty(bt)) {
+        return 0;
+    }
+    if(is_leaf(bt)) {
+        return bt->data;
+    }
+    return sum_leaf(bt->left)+sum_leaf(bt->right);
+}
+

homework4/BiTree.h

@@ -4,7 +4,14 @@
 
 
 class BiTree {
+public:
+    int data;
+    BiTree *left;
+    BiTree *right;
 
+    static bool is_empty(BiTree *bt);
+    static bool is_leaf(BiTree *bt);
+    static int sum_leaf(BiTree *bt);
 };
 
 

homework4/test1.cpp

@@ -0,0 +1,32 @@
+#include<iostream>
+#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 createTree(BiTree*& bt, int value) {
+    if (bt == nullptr) {
+        bt = createNode(value);
+    } else {
+        if (value < bt->data) {
+            createTree(bt->left, value);
+        } else if (value > bt->data) {
+            createTree(bt->right, value);
+        }
+    }
+}
+
+int main() {
+    BiTree* root = nullptr;
+    for (int i = 0; i < 10; i++) {
+        createTree(root, i);
+    }
+    cout << BiTree::sum_leaf(root) << endl;
+    return 0;
+}