exam7-3.cpp

来自「数据结构c++-书的一些源代码」· C++ 代码 · 共 31 行

#include <iostream.h>
#include <stdlib.h>

#include "BiTreeNode.h"
#include "BiTree.h"

template <class T>
void Visit(T item)
{
	cout << item << "   ";
}

void main(void)
{

	BiTree<char> a, b, c, d, e, f, g, null;
	g.MakeTree('G', null, null);
	d.MakeTree('D', null, g);
	b.MakeTree('B', d, null);
	e.MakeTree('E', null, null);
	f.MakeTree('F', null, null);
	c.MakeTree('C', e, f);
	a.MakeTree('A', b, c);
	
	cout << "前序遍历序列为：";
	a.PreOrder(Visit);

	cout << "\n撤消序列为：    ";
	a.Destroy();
}