数据结构课程设计之-树与二叉树的转换(13)

int i=1; int fa,ch; PTNode p; for(i=1;ch!=-1;i++) { printf("输入第%d结点:\n",i); scanf("%d,%d",&fa,&ch); printf("\n"); p.data=ch; p.parent=fa; T.count++;

T.node[T.count].data = p.data; T.node[T.count].parent = p.parent; } printf("\n"); printf("创建的树具体情况如下:\n"); print_ptree(T); return T; }

/*一般树转换成二叉树*/ BTNode *change(PTree T) { int i,j=0; BTNode p[MAX_TREE_SIZE]; BTNode *ip,*is,*ir,*Tree; ip=(BTNode *)malloc(sizeof(BTNode)); is=(BTNode *)malloc(sizeof(BTNode)); ir=(BTNode *)malloc(sizeof(BTNode)); Tree=(BTNode *)malloc(sizeof(BTNode)); for(i=0;i<T.count;i++) { p[i]=GetTreeNode(T.node[i].data); } for(i=1;i<T.count;i++) { ip=&p[i]; is=&p[j]; while(T.node[i].parent!=is->data) { j++; is=&p[j]; }