bitreeexample.h

来自「数据结构头文件源代码」· C头文件 代码 · 共 45 行

void MakeCherTree(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;

   if(num==1)
   {
	   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);
   }
   else if(num==2)
   {
       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);
   }
   else if(num==3)
   {
	   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);
   }
}