//Author:张佳琪
#include <stdio.h>
#include <stdlib.h>
#define MAX_TREE_SIZE 20
typedef char TElemType;
typedef struct
{
TElemType data;
int parent;
}TNode;
typedef struct
{
TNode box[MAX_TREE_SIZE];
int n;
}Tree;
void init(Tree *T)
{
int i,j;
char ch;
printf("输入结点个数:");
scanf("%d",&(T->n));
for(i=0;i<T->n;i++)
{
fflush(stdin);
printf("输入结点值以及双亲序号:");
scanf("%c %d",&ch,&j);
T->box[i].data=ch;
T->box[i].parent=j;
}
T->box[0].parent=-1;
}
void findparent(Tree *T)
{
int i;
printf("输入查询结点的序号:");
scanf("%d",&i);
printf("%c 结点的双亲是 %c\n",T->box[i].data,T->box[T->box[i].parent].data);
}
int main()
{
Tree T;
init(&T);
findparent(&T);
return 0;
}