本文整理汇总了C++中BinTree::levelorder_traverse方法的典型用法代码示例。如果您正苦于以下问题：C++ BinTree::levelorder_traverse方法的具体用法？C++ BinTree::levelorder_traverse怎么用？C++ BinTree::levelorder_traverse使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类BinTree的用法示例。
在下文中一共展示了BinTree::levelorder_traverse方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: main
int main (int argc, char *argv[])
{
string treestr("one two three # # # four five six # seven # # # eight nine # # #\n");
istringstream sin(treestr);
BinTree<string> tree;
sin >> tree;
cout << tree << endl;
cout << "先序输出:" << endl;
cout << "0. ";
tree.preorder_traverse();
cout << "1. ";
tree.preorder_traverse_nore();
cout << "2. ";
tree.preorder_traverse_nore2();
cout << "3. ";
tree.preorder_traverse_nore3();
cout << "中序输出:" << endl;
cout << "1. ";
tree.inorder_traverse_nore();
cout << "2. ";
tree.inorder_traverse_nore2();
cout << "后序输出:" << endl;
tree.postorder_traverse();
cout << "层序输出:" << endl;
tree.levelorder_traverse();
return EXIT_SUCCESS;
} // ---------- end of function main ----------