C++ (Cpp) Tree::PostOrder Examples

Example #1

File: data-structures-tree-traversal.cpp Project: M0eB/cpp-practice

//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;
}

Example #2

File: Main.cpp Project: JustinMorritt/C-

int main()
{
	Tree tree;
	RandGen rg;

	int i = 0;
	while (i < 100)
	{
		if (tree.Insert(rg(100) - 50))
		{
			++i; //Need a tree Transversal (display) "pre order" "post order"
		}
	}

	//TRANSVERSAL OUTPUTS  ******ROOT IS BEGGINING OF PRE AND END OF POST*********
	tree.InOrder(std::cout);
	std::cout << std::endl;
	std::cout << std::endl;
	tree.PreOrder(std::cout);
	std::cout << std::endl;
	std::cout << std::endl;
	tree.PostOrder(std::cout);
	std::cout << std::endl;
	std::cout << std::endl;

	system("pause");
	return 0;
}

Example #3

File: tree-graph-problems.cpp Project: M0eB3/cpp-practice

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;
}