void print_tree_details(BinarySearchTree &bst) {
bst.print_tree();
cout << "\n";
cout << "min: " << bst.find_min() << "\n";
cout << "max: " << bst.find_max() << "\n";
cout << "nodes: " << bst.node_count() << "\n";
cout << "count total: " << bst.count_total() << "\n";
cout << "tree height: " << bst.tree_height() << "\n";
cout << "\n";
}
void test_find_min() {
BinarySearchTree * tree = new BinarySearchTree;
test_insert(tree);
cout << tree->find_min() << "\n";
}