树的四种遍历和求父结点.doc

树的四种遍历和求父结点 //queue.h #includeiostream using namespace std; typedef char TElemType; typedef struct node { TElemType data; struct node*lchild; struct node*rchild; }BiTNode,*BinTree; typedef BiTNode* QElemType; typedef struct QNode { QElemType data; struct QNode *next; }QNode,*QueuePtr; typedef struct { QueuePtr front; QueuePtr rear; }LinkQueue; void InitQueuePtr(LinkQueueQ)//初始化 { Q.front=Q.rear=new QNode; if(!Q.front) exit(0); Q.front-next=NULL; } void DestroyQueue(LinkQueueQ)//摧毁队列 { while(Q.front) { Q.rear=Q.front-next; free(Q.front); Q.front=Q.rear; } } void EnQueue(LinkQueueQ,QElemType e)//插入队列 { QueuePtr p=new QNode; if(!p) exit(0); p-data=e; p-next=NULL; Q.rear-next=p; Q.rear=p; } void GetHead(LinkQueue Q,QElemTypee) { if(Q.front!=Q.rear) e=Q.front-next-data; } void DeQueue(LinkQueue Q,QElemTypee)//出队列 { QueuePtr p=new QNode; if(Q.front==Q.rear) return; p=Q.front-next; e=p-data; Q.front-next=p-next; if(Q.rear==p) Q.rear=Q.front; free(p); } bool QueueEmpty(LinkQueueQ) { if(Q.front==Q.rear) return true; return false; } //SqStack.h #includeiostream using namespace std; typedef BiTNode* SElemType; //typedef BiTNode* QElemType; const int STACK_INIT_SIZE=100; const int STACKINCREMENT=10; typedef struct { SElemType *base; SElemType *top; int StackSize; }SqStack; void InitStack(SqStackS)//栈的初始化 { S.base=new SElemType[STACK_INIT_SIZE]; if(S.base==NULL) exit(0); S.top=S.base; S.StackSize=STACK_INIT_SIZE; } void Push(SqStackS,SElemType e)//压栈 { if(S.top-S.base=S.StackSize) { S.base=(SElemType*)realloc(S.base,(S.StackSize+STACKINCREMENT)*sizeof(SElemType)); if(S.base==NULL) return; S.top=S.base+STACK_INIT_SIZE; S.StackSize+=STACKINCREMENT; } *S.top++=e; } void GetTop(SqStack S,SElemTypee)//获取栈顶元素 { if(S.top==S.base) return; e=*(S.top-1); } bool StackEmpty(SqStack S) { if(S.base==S.top) return true; return false; } bool Pop(SqStackS,SElemTypee)//退栈 { if(S.top==S.base) return false; e=*--S.to