树的孩子表示法

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>

#define MAX_SIZE 100

//将子结点设计为链表
typedef struct chileNode
{
	int id;
	struct chileNode* next;
}cNode;

//每个结点其实又是一个head结点，其中存储该结点下的子结点组成的链表的头结点以及自身的id
typedef struct head
{
	int id;            //代表在node数组中的位置
	cNode* firstPtr;   //指向子节点的指针，用来存储子节点链表的头结点
}headArray;

typedef struct Tree
{
	headArray node[MAX_SIZE];  //结点数组
	int r, n;                  //根位置和结点数    
};

//和单链表一样的，来两头尾指针，咋样？
cNode* phead = NULL;
cNode* ptail = NULL;

//初始化头结点
void InitChildNode()
{
	phead = (cNode*)malloc(sizeof(cNode));
	phead->id = 0;
	phead->next = NULL;
}

void InitTree(struct Tree* mytree)
{
	mytree->r = 0;   //根节点位置
	printf("请输入结点数量：");
	scanf("%d", &(mytree->n));

	for (int i = 0; i < mytree->n; i++)
	{
		setbuf(stdin, NULL);
		printf("请输入结点id：");
		scanf("%d", &(mytree->node[i].id));  
		setbuf(stdin, NULL);

		//为指向子结点链表头结点的指针分配空间
		mytree->node[i].firstPtr = (cNode*)malloc(sizeof(cNode));
		mytree->node[i].firstPtr->next = NULL;

		printf("请问%d个结点有多少个子结点呢？", i + 1);
		int nums;
		scanf("%d", &nums);
		setbuf(stdin, NULL);

		//如果有子结点数不为0，就生成子结点，然后链在一起
		if (nums)
		{
			ptail = mytree->node[i].firstPtr;
			phead = ptail;

			for (int i = 0; i < nums; i++)
			{
				cNode* new_node = (cNode*)malloc(sizeof(cNode));
				new_node->next = NULL;

				printf("请输入当前第%d个子结点的id：", i+1);
				scanf("%d", &(new_node->id));

				ptail->next = new_node;
				ptail = new_node;
			}

		}
	}
}

void findOneNodeAllKids(struct Tree* mytree, int child_id)
{
	int flag = 0;

	for (int i = 0; i < mytree->n; i++)
	{
		if (child_id == mytree->node[i].id && mytree->node[i].firstPtr->next != NULL)
		{
			cNode* head = mytree->node[i].firstPtr;    //指向长子，遍历
			while (head->next != NULL)
			{
				printf("%d", head->next->id);
				head = head->next;
			}
			return;
		}
	}
	printf("这个结点木得子结点\n");
}

int main(void) 
{
	struct Tree mytree;
	InitChildNode();
	InitTree(&mytree);

	findOneNodeAllKids(&mytree, 2);
	setbuf(stdin, NULL);

	system("pause");
	return 0;
}