本文整理汇总了C++中BinaryTree::displayPreOrder方法的典型用法代码示例。如果您正苦于以下问题：C++ BinaryTree::displayPreOrder方法的具体用法？C++ BinaryTree::displayPreOrder怎么用？C++ BinaryTree::displayPreOrder使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类BinaryTree的用法示例。
在下文中一共展示了BinaryTree::displayPreOrder方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: manipulateTree
void manipulateTree(BinaryTree<T> tree) // manipulateTree method start
{
// local variable
int choice;
T value;
do
{
choice = submenu(tree.countNodes());
switch (choice)
{
case 1: cout << "\nEnter a value to add: ";
cin >> value;
tree.insertNode(value);
break;
case 2: cout << "\nEnter a value to remove: ";
cin >> value;
try
{
tree.remove(value);
} // end try
catch (BinaryTree<T>::EmptyNode)
{
cout << "\nThe value you entered was not in the tree.\n";
} // end catch
break;
case 3: tree.displayInOrder();
break;
case 4: tree.displayPreOrder();
break;
case 5: tree.displayPostOrder();
break;
case 6: cout << "\nThere are " << tree.countLeaves() << " leaves in the tree.\n";
break;
} // end switch
} while (choice != EXIT);
} // manipulateTree method end