#include "mytree.h"
#include <vector>

using namespace std;

#define OK 		(0)
#define ERROR	(-1)

#define MAX_NAME_LEN (50) //最大的名字長度

/*樹結構體中資料成員*/
typedef struct _ElementType
{
	int id;
	char name[MAX_NAME_LEN];
}ElementType;

/*樹節點結構體*/
typedef struct _TreeNode
{
	int index;//結點的標識
	ElementType element;   //資料域
	struct _TreeNode *FirstChild; //第一個孩子指標	
	struct _TreeNode *NextSibing; //下一個兄弟 指標
}TreeNode;

/*樹結構體*/
typedef struct _CTree
{
	int num; //節點個數
	vector<int> nodeIndexs;//存放所有的結點index
	int rootIndex;//根節點的index
	TreeNode *root; //根節點指標
}CTree;

/*全域性資料儲存樹資訊*/
CTree g_tree;

/*
*    功能：檢測結點的index是否正確
*	 入參：要檢測的結點index
*	返回值：合法index返回true，不合法的index返回false
*/
static bool mytree_check_node_index(const int index)
{
	vector<int>::iterator it;

	for(it = g_tree.nodeIndexs.begin(); it != g_tree.nodeIndexs.end(); ++it )
	{
		if(*it == index)
		{
			return true;
		}
	}

	return false;
}

/*
*    功能：獲取指定的結點指標
*	 入參：父節點，比較引數index，出參nodeinfo
*	 返回值：NA
*/
void mytree_preorder_get_node(TreeNode *tree,	int index,   TreeNode *nodeinfo)
{
	if (NULL != tree)
	{
		if (tree->index == index)
		{
			nodeinfo = tree;
			return;
		}
		mytree_preorder_get_node(tree->FirstChild, index, nodeinfo);
		mytree_preorder_get_node(tree->NextSibing, index, nodeinfo);
	}
	
	return ;
}

/*
*	功能：通過結點的index獲取結點的指標資訊
*	入參：查詢結點的index
*	返回值：成功返回指向結點的指標，不成功返回NULL
*/
TreeNode *mytree_get_node_by_index(const int index)
{
	TreeNode *tmpNode = NULL;
	TreeNode *root = NULL;
		
	if(true != mytree_check_node_index(index)) 
	{
		printf("invalied index\n");
		return NULL;
	}

	root = g_tree.root;

	//遍歷當前的樹，返回指定結點的指標
	mytree_preorder_get_node(root, index, tmpNode);

	return tmpNode;
}


/*
*	功能：設定一個孩子到樹中
*	入參：parentIndex: 父節點的index
	  element ：孩子結點的資訊
*	返回值：插入成功返回0， 失敗返回-1
*/
int mytree_set_child(int parentIndex, int index, ElementType element)
{
	TreeNode *parentNode = NULL;
	TreeNode *newNode = NULL;
	TreeNode *head = NULL;
	TreeNode *lastChild = NULL;
	
	//檢測父節點是否有效
	if(true != mytree_check_node_index(parentIndex)) 
	{
		printf("invalied parent index\n");
		return ERROR;
	}

	parentNode = mytree_get_node_by_index(parentIndex);
	if (NULL == parentNode)
	{
		return ERROR;
	}

	//lastChild = mytree_get_last_child(parentNode);
	newNode = (TreeNode *)malloc(sizeof(TreeNode));
	if(NULL == newNode)
	{
		return ERROR;
	}
	memset(newNode, 0, sizeof(TreeNode));
	newNode->index = index;
	newNode->element.id = element.id;
	memcpy(newNode->element.name, element.name, MAX_NAME_LEN);

	g_tree.nodeIndexs.push_back(index);
	g_tree.num++;

	if (NULL == parentNode->FirstChild)
	{
		parentNode->FirstChild = newNode;
		return OK;
	}
	
	if(NULL == parentNode->NextSibing)
	{
		parentNode->NextSibing = newNode;
		return OK;
	}

	head = parentNode->NextSibing;
	while(head)
	{
		lastChild = head;
		head = head->NextSibing;
	}

	lastChild->NextSibing = newNode;

	return OK;
}

/*
*	功能：設定一個樹的根節點
*	入參：  element ：根結點的資訊
*	返回值：插入成功返回0， 失敗返回-1
*/
int mytree_set_root( ElementType element)
{
	//檢測父節點是否有效
	TreeNode *newNode = NULL;

	newNode = (TreeNode *)malloc(sizeof(TreeNode));
	if (NULL == newNode)
	{
		return ERROR; 
	}
	memset(newNode, 0, sizeof(TreeNode));

	newNode->index = 0;//根節點index
	newNode->FirstChild = NULL;
	newNode->NextSibing = NULL;
	newNode->element.id = element.id;
	memcpy(newNode->element.name, element.name, MAX_NAME_LEN);

	g_tree.nodeIndexs.push_back(0);
	g_tree.num++;
	g_tree.root = newNode;
	
	return OK;
}


/*
*	功能：初始化當前樹
*	入參：無
*	返回值：無
*/
void mytree_init()
{
	g_tree.num = 0;
	g_tree.rootIndex = 0;
	g_tree.root = NULL;

	return;
}


/*
*    功能：獲取指定的結點指標
*	 入參：父節點，比較引數index，出參nodeinfo
*	 返回值：NA
*/
void mytree_preorder_visit(TreeNode *tree)
{
	if (NULL != tree)
	{
		printf("tree index :%d\n", tree->index);
		printf("tree element id :%d\n", tree->element.id);
		printf("tree element id :%s\n", tree->element.name);
		mytree_preorder_get_node(tree->FirstChild);
		mytree_preorder_get_node(tree->NextSibing);
	}
	
	return ;
}


/*
*    功能：列印整個樹的結點
*	 入參：父節點，比較引數index，出參nodeinfo
*	 返回值：NA
*/
void mytree_dump()
{
	// 各種遍歷方式去訪問樹的各個結點
	mytree_preorder_visit(g_tree.root)
	return ;
}


/*
*	功能：建立一棵樹
*	入參：無
*	返回值：無
*/

void mytree_create()
{
	ElementType element;

	memset(&element, 0, sizeof(ElementType));
	//初始化一棵樹
    mytree_init();
	//設定樹的根節點
	element.id = 0;
	strcncpy(element.name, "root", sizeof(element.name)-1);
	mytree_set_root(element);

	//設定葉子結點
	memset(&element, 0, sizeof(ElementType));
	element.id = 1;
	strcncpy(element.name, "root-child-1", sizeof(element.name)-1);
	mytree_set_child(0, 1, element);

	memset(&element, 0, sizeof(ElementType));
	element.id = 2;
	strcncpy(element.name, "root-child-2", sizeof(element.name)-1);
	mytree_set_child(0, 2, element);

	memset(&element, 0, sizeof(ElementType));
	element.id = 3;
	strcncpy(element.name, "root-child-3", sizeof(element.name)-1);
	mytree_set_child(0, 3, element);

	memset(&element, 0, sizeof(ElementType));
	element.id = 4;
	strcncpy(element.name, "root-child-1-1", sizeof(element.name)-1);
	mytree_set_child(1, 4, element);

	memset(&element, 0, sizeof(ElementType));
	element.id = 5;
	strcncpy(element.name, "root-child-1-2", sizeof(element.name)-1);
	mytree_set_child(1, 5, element);

	return ;
}

/*
*	功能：測試當前樹結構
*	入參：無
*	返回值：無
*/

void tree_test()
{
    //建立一棵樹
	mytree_create();

	//列印樹的結點
	mytree_dump();
	return ;
}