#include <iostream>
#include "binarySearchTree.h"
usingnamespace std;
int main()
{
bSearchTreeType<int> tree;
int num;
//enter numbers and to end it enter a -999
cout << "please enter number with a space and end it with -999\n: ";
cin >> num;
//end when the last number is -999
while(num != -999)
{
tree.insert(num);
cin >> num;
}
//print the list
cout << "print tree : \n";
tree.leavesCount();
return 0;
}