#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 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]);
    }
    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;
}