本文整理汇总了C++中BST::countLeaves方法的典型用法代码示例。如果您正苦于以下问题：C++ BST::countLeaves方法的具体用法？C++ BST::countLeaves怎么用？C++ BST::countLeaves使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类BST的用法示例。
在下文中一共展示了BST::countLeaves方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: main
//.........这里部分代码省略.........
cout << "Inserting: 12\n";
tree.insert(12);
cout << "Inorder: ";
tree.showInOrder();
cout << endl;
cout << "Preorder: ";
tree.showPreOrder();
cout << endl;
cout << "Postorder: ";
tree.showPostOrder();
cout << endl;
cout << "***\n";
cout << "Inserting: 9\n";
tree.insert(9);
cout << "Inorder: ";
tree.showInOrder();
cout << endl;
cout << "Preorder: ";
tree.showPreOrder();
cout << endl;
cout << "Postorder: ";
tree.showPostOrder();
cout << endl;
system("pause");
system("cls");
cout << "Testing isExist:\n";
cout << "\tSearching for 10: " << (tree.isExists(10) ? "Found" : "Not Found") << endl;
cout << "\tSearching for 12: " << (tree.isExists(12) ? "Found" : "Not Found") << endl;
system("pause");
system("cls");
/////////////////////////// I added this code ///////////////////////////
cout << "Testing countNodes:\n";
cout << setw(25) << "Number of nodes: " << tree.countNodes() << endl;
cout << "Testing countLeaves:\n";
cout << setw(25) << "Number of leaves: " << tree.countLeaves() << endl;
system("pause");
system("cls");
cout << "Testing height:\n";
cout << setw(25) << "Height: " << tree.height() << endl;
system("pause");
system("cls");
cout << "Testing printPath:\n";
cout << "Path to 5: " << endl;
tree.printPath(5);
cout << endl;
cout << "Path to 3: " << endl;
tree.printPath(3);
cout << endl;
cout << "Path to 8: " << endl;
tree.printPath(8);
cout << endl;
cout << "Path to 12: " << endl;
tree.printPath(12);
cout << endl;
cout << "Path to 9: " << endl;
tree.printPath(9);
cout << endl;
system("pause");
system("cls");
/////////////////////////// I added this code ///////////////////////////
cout << "Testing remove:\n";
cout << setw(25) << "Original Tree: ";
tree.showInOrder();
cout << endl;
cout << setw(25) << "After Removing 12: ";
tree.remove(12);
tree.showInOrder();
cout << endl;
cout << setw(25) << "After Removing 5: ";
tree.remove(5);
tree.showInOrder();
cout << endl;
cout << setw(25) << "After Removing 1: ";
tree.remove(1);
tree.showInOrder();
cout << endl;
system("pause");
return 0;
}