本文整理汇总了C++中Tree::PreOrder_NoRecursion方法的典型用法代码示例。如果您正苦于以下问题：C++ Tree::PreOrder_NoRecursion方法的具体用法？C++ Tree::PreOrder_NoRecursion怎么用？C++ Tree::PreOrder_NoRecursion使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类Tree的用法示例。
在下文中一共展示了Tree::PreOrder_NoRecursion方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: tree_traversal_main
//int main( void )
int tree_traversal_main()
{
Tree* tree = new Tree();
tree->AddNode( 30 );
tree->AddNode( 10 );
tree->AddNode( 20 );
tree->AddNode( 40 );
tree->AddNode( 50 );
cout << "In order traversal" << endl;
tree->InOrder( tree->Root( ) );
cout << endl << endl;
cout << "Pre order traversal" << endl;
tree->PreOrder( tree->Root( ) );
cout << endl << endl;
cout << "Pre order traversal - no recursion" << endl;
tree->PreOrder_NoRecursion( tree->Root( ) );
cout << endl << endl;
cout << "Post order traversal" << endl;
tree->PostOrder( tree->Root( ) );
cout << endl << endl;
cout << "Tree Height : " << tree->Height( tree->Root() ) << endl;
cout << endl << endl;
delete tree;
return 0;
}示例2: main
std::string
int main( void )
{
Tree* tree = new Tree();
tree->AddNode( 30 );
tree->AddNode( 10 );
tree->AddNode( 20 );
tree->AddNode( 40 );
tree->AddNode( 50 );
cout << "In order traversal" << endl;
tree->InOrder( tree->Root( ) );
cout << endl << endl;
cout << "Pre order traversal" << endl;
tree->PreOrder( tree->Root( ) );
cout << endl << endl;
cout << "Pre order traversal - no recursion" << endl;
tree->PreOrder_NoRecursion( tree->Root( ) );
cout << endl << endl;
cout << "Post order traversal" << endl;
tree->PostOrder( tree->Root( ) );
cout << endl << endl;
cout << "Tree Height : " << tree->Height( tree->Root() ) << endl;
cout << endl << endl;
cout << Round( 123.456, 2 ) << endl;
delete tree;
return 0;
}