本文整理汇总了C++中BinTree::displayPreOrder方法的典型用法代码示例。如果您正苦于以下问题：C++ BinTree::displayPreOrder方法的具体用法？C++ BinTree::displayPreOrder怎么用？C++ BinTree::displayPreOrder使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类BinTree的用法示例。
在下文中一共展示了BinTree::displayPreOrder方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: main
int main(int argc, char** argv)
{
srand(time(0));
BinTree tree;
cout << "Inserting 6 nodes with random values: " << endl;
tree.insertNode(rand()%100+1);
tree.insertNode(rand()%100+1);
tree.insertNode(rand()%100+1);
tree.insertNode(rand()%100+1);
tree.insertNode(rand()%100+1);
tree.insertNode(rand()%100+1);
int x = rand()%100+1;
tree.insertNode(x);
cout << endl;
cout << "Values displayed using in-order traversal: " << endl;
tree.displayInOrder();
cout << endl;
cout << "Values displayed using pre-order traversal: " << endl;
tree.displayPreOrder();
cout << endl;
cout << "Values displayed using post-order traversal: " << endl;
tree.displayPostOrder();
cout << endl;
cout << "Deleting a node: value " << x << " removed." << endl;
tree.remove(x);
cout << "Values displayed using in-order traversal after deleting node: " << endl;
tree.displayInOrder();
cout << endl;
return 0;
}