32 lines
690 B
C++
32 lines
690 B
C++
#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;
|
|
} |