test.cpp

树的建立算法和树的遍历操作。。。下载解压即可

#include "BinTree.cpp"
#include <iostream>
#include <vector>
using namespace std;

void Test1();
void Test2();
void Test3();

main()
{ //Test1();
  Test2();
 Test3();
}

void Test1()
{ BinTree<char> bt;
  for(int i=3; i<20; i++)
		cout<<bt.GetTreeCount(i)<<" ";
	cout<<endl; 
}

void Test2()
{ char s[14]="ABD**E**CF***";
	vector<char> pre(s,s+14);
	BinTree<char> bt1(pre);
	BinTree<char> bt2(bt1);
  bt2.TraverseDFS(1); 
  bt2.TraverseDFS(2); 
  bt2.TraverseDFS(3); 
  bt2.TraverseBFS();
  cout<<bt2.Search('C')->data<<endl;  
  cout<<bt2.SearchParent('E')->data<<endl;  
  cout<<bt2.SearchParent('F')->data<<endl;  
}

void Test3()
{	char spre[10]="ABHFDECKG";
  char smid[10]="HBDFAEKCG";
	vector<char> pre(spre,spre+9);
	vector<char> mid(smid,smid+9);
	BinTree<char> bt(pre,mid);
  bt.TraverseDFS(1); 
  bt.TraverseDFS(2); 
  bt.TraverseDFS(3); 
}