Example #1
0
//先序遍历树
void PreOrderTraversal(AvlTree tree) {
	if (tree == NULL)
		return;
	VisitElement(tree);
	PreOrderTraversal(tree->left);
	PreOrderTraversal(tree->right);
}
Example #2
0
void PreOrderTraversal(TreeNode * root)
{
    if(root) {
        std::cout << " " << root->Key<< " " ;
        PreOrderTraversal(root->Left);
        PreOrderTraversal(root->Right);
    }
}
Example #3
0
void BTree::Print(OrderType Order) const
{
    if(Order ==InOrder)
    {
        std::cout << " InOrder" << std::endl;
        InOrderTraversal(root);
        std::cout << std::endl;
    }
    else if(Order == PostOrder) {
        std::cout << " PostOrder" << std::endl;
        PostOrderTraversal(root);
        std::cout << std::endl;

    }
    else if(Order == PreOrder) {
        std::cout << " PreOrder" << std::endl;
        PreOrderTraversal(root);
        std::cout << std::endl;

    }
    else if(Order == LevelOrder) {
        std::cout << " LevelOrder" << std::endl;
        LevelOrderTraversal(root);
        std::cout << std::endl;
    }
}