control.cpp

来自「二叉排序树相关操作示例 二叉排序树相关操作示例」· C++ 代码 · 共 29 行

// control.cpp
#include "BinaryTree.h"

void print_worker(CItem* pItem)
{
	printf("%d - %s\n",pItem->m_nIndex,pItem->m_strValue);
}

int main()
{
	CBinaryTree tree;
	CItem item1(200,"上海"),item2(100,"北京"),item3(500,"山东"),item4(300,"天津"),item5(400,"广州") ;
	tree.AddNode(2,item1);
	tree.AddNode(1,item2);
	tree.AddNode(5,item3);
	tree.AddNode(3,item4);
	tree.AddNode(4,item5);

	printf("前序遍历结果是：\n");
	tree.TraversePreOrder(tree.m_pRootNode,print_worker);

	printf("中序遍历结果是：\n");
	tree.TraverseInOrder(tree.m_pRootNode,print_worker);

	printf("后序遍历结果是：\n");
	tree.TraversePostOrder(tree.m_pRootNode,print_worker);

	return 0;
}