BiTree.h:顺序存储二叉树及其基本操作
enum {MAX_TREE=100,OK=0,WRONG=-1};
typedef int BTree[MAX_TREE];
typedef int Status;
struct position
{
 int level,order;
};
void InitBiTree(BTree &T)
{
 memset(T,0,sizeof(int)*MAX_TREE);
}
Status CreateBiTr[......]

继续阅读