7-2.cpp

来自「大学计算机专业课程中数据结构各章的算法设计」· C++ 代码 · 共 27 行

#include"Tree1.h"
#include<String.h>
TreeNode1 *createComplete(char *str,int i)
{
	TreeNode1 *p=NULL;
	static int len=strlen(str);
	if(i-1<len)
	{
		cout<<" str["<<i-1<<"]= "<<str[i-1]<<"\n";
		p=new TreeNode1(str[i-1]);
		p->left=createComplete(str,2*i);
        p->right=createComplete(str,2*i+1);

	}
return p;
}
void main()
{
	char *str="ABCDEFGH";
	cout<<"The Tree: "<<str<<"\n";
	Tree1 t1;
	t1.root=createComplete(str,1);
	t1.preorder();
	t1.inorder();
	t1.postorder();
}