樹的孩子表示法

#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;
}