//
//习题6.7 由完全二叉树数组 建立二叉链表
BiTree buildec2(char A[] ,int N,int i)
{
BiTree T = NULL;
if (i <= N)
{
T = (BiTree) malloc(sizeof(BiTNode) ) ;
T ->data = A[i] ;
if (2 * i <= N)
T ->lchild = buildec2(A,N,2 * i) ;
else
T ->lchild =NULL ;
if (2 * i +1 <= N)
T ->rchild = buildec2(A,N,2 * i + 1) ;
else
T ->rchild = NULL ;
}
return T ;
}
习题6.7
最新推荐文章于 2023-11-20 14:01:20 发布