int tree[3] 3 5 8 2 6 9 7
3(0)
5(1) 8(2)
2(3) 6(4) 9(5) 7(6)
父节点下标*2+1 左边节点
父节点下标*2+2 右边节点
树的基本操作:
1.树的创建和销毁
2.树的节点的搜索
3.树的节点的添加和搜索
4.树的节点的遍历
BOOL CreateTree (Tree *pTree, Node *pRoot);
void DestoryTree (Tree *pTree);
Node *SearchTree (Tree *pTree, int nodeIndex);
BOOL AddNode (Tree *pTree, int nodeIndex, int direction , Node *pNode);
BOOL DeleteNode (Tree *pTree, int nodeIndex, Node *pNode);
void TreeTraverse(Tree *pTree);