bitreeexample.h

数据结构的一些教程....比较适于初学者

//构造几个具体的二叉树(P.188)
void MakeCharTree(BiTreeNode<char>* &root,int num)
{
	BiTreeNode<char> *b,*c,*d,*e,*f,*g,*h,*i;
	BiTreeNode<char> *j,*k,*l,*m,*n,*o,*null=NULL;

	switch(num)
	{
	case 1:                    //构造图7-11(a)的二叉树(P.173)
		g=GetTreeNode('G');
		d=GetTreeNode('D',g);
		b=GetTreeNode('B',d,null);
		e=GetTreeNode('E');
		f=GetTreeNode('F');
		c=GetTreeNode('C',e,f);
		root=GetTreeNode('A',b,c);
		break;
	case 2:                   //构造图7-11(b)的二叉树(P.173)
		g=GetTreeNode('G');
		d=GetTreeNode('D',null,g);
		b=GetTreeNode('B',d);
		e=GetTreeNode('E');
		f=GetTreeNode('F');
		c=GetTreeNode('C',e,f);
		root=GetTreeNode('A',b,c);
		break;
	case 3:                       //构造图7-12(a)的二叉树(P.173)
		h=GetTreeNode('H');
		i=GetTreeNode('I');
		d=GetTreeNode('D',h,i);
		j=GetTreeNode('J');
		k=GetTreeNode('K');
		e=GetTreeNode('E',j,k);
		b=GetTreeNode('B',d,e);
		l=GetTreeNode('L');
		m=GetTreeNode('M');
		f=GetTreeNode('F',l,m);
		n=GetTreeNode('N');
		o=GetTreeNode('O');
		g=GetTreeNode('G',n,o);
		c=GetTreeNode('C',f,g);
		root=GetTreeNode('A',b,c);
	}
}