#include
#include
#include

char?tree[200]IllegalMove[20];

typedef?struct?ChildList*?Child;

typedef?struct?NODE
{
	char?Name;
	char?Pure;?//高度是否純奇數(shù)?或?純偶數(shù)。
	int?Height;?//該樹(shù)的高度
	struct?NODE?*?Father;?//父節(jié)點(diǎn)
	Child?List;?//孩子節(jié)點(diǎn)
}*Tree;
struct?ChildList
{
	Tree?SubTree;
	Child?Next;
};
Tree?PeoVsBot;
void?AddASubTree（Tree?father?Tree?child）
{
	Child?TempCell;
	TempCell?=?（Child）malloc（sizeof（struct?ChildList））;
	TempCell->SubTree?=?child;
	TempCell->Next?=?father->List;
	father->List?=?TempCell;
}
Tree?CreateTree（char?name?Tree?Father）
{
	Tree?ATree;
	ATree?=?（Tree）malloc（sizeof（struct?NODE））;
	ATree->Father?=?Father;
	ATree->Height?=?0;
	ATree->List?=?NULL;
	ATree->Name?=?name;
	ATree->Pure?=?1;
	if?（Father?!=?NULL）
	{
		AddASubTree（Father?ATree）;
	}
	return?ATree;
}
void?PrintStr（char?s[]）
{
	int?len?i;
	len?=?strlen（s）;
	for?（i?=?0;?i?	{
		if?（s[i]?==?‘?‘）?putchar（NULL）;
		else?printf（“%c“?s[i]）;
	}
	printf（“\n“）;
}
int?PrintTree（int?father?int?height?Tree?GrandFather）//當(dāng)前節(jié)點(diǎn)（下標(biāo)）是father，GrandFather是當(dāng)前節(jié)點(diǎn)的父節(jié)點(diǎn)地址
{
	int?i;
	for?（i?=?0;?i?	{
		putchar（NULL）;
		putchar（NULL）;
		putchar（NULL）;
		putchar（NULL）;
	}
	printf（“%c\n“?tree[father]）;
	Tree?CurrentNode;
	CurrentNode?=?CreateTree（tree[father]?GrandFather）;
	if?（height?==?0）
	{
		PeoVsBot?=?CurrentNode;
	}
	for?（i?=?father?+?1;?1;?i++）
	{
		if?（tree[i]?==?‘）‘）
		{
			//修改grandfather的heightpure?//樹(shù)的根沒(méi)有father
			if?（CurrentNode->Father?!=?NULL）
			{
				if?（CurrentNode->Father->Height?==?0）
				{
					CurrentNode->Father->Height?=?CurrentNode->Height?+?1;
				}
				else
				{
					if?（CurrentNode->Father->Pure?==?1?&&?（（CurrentNode->Height+1）?%?2?!=?CurrentNode->Father->Height?%?2））
					{
						CurrentNode->Father->Pure?=?0;
					}
					if?（CurrentNode->Height?+?1?>?CurrentNode->Father->Height）
					{
						CurrentNode->Father->Height?=?CurrentNode->Height?+?1;
					}
				}
			}
			return?i;//返回這課樹(shù)的結(jié)束的下標(biāo)
		}
		else?if?（tree[i]?==?‘（‘）//還要判斷輸入是不不是標(biāo)準(zhǔn)的。即函數(shù)判斷（）之間是否有節(jié)點(diǎn)
		{
			i?=?PrintTree（i?+?1?height?+?1?CurrentNode）;//子樹(shù)??得到返回值?i
		}
	}
}

Tree?Bot（Tree?father）//計(jì)算機(jī)操作
{
	Child?Temp?=?father->List;
	Tree?SureStep?=?NULL?NotSureStep?=?NULL;
	while?（Temp?!=?NULL）
	{
		if?（Temp->SubTree->Pur