basic.cpp

实现了对家谱管理系统的添加

#include"Tree.h"

const int stack_init_size=200;
const int stackincrement=49;

Stack InitStack()
{
	Stack S;
	S.base=new memberTree*[stack_init_size];
	if(!S.base)abort();
	S.top=S.base;
	S.stacksize=stack_init_size;
	return S;
}


void Push(Stack &S,memberTree *T)
{
	if(S.top-S.base>=S.stacksize)
	{
		S.base=new memberTree*[S.stacksize+stackincrement];
		S.top=S.base+S.stacksize;
		S.stacksize+=stackincrement;
	}
	if(!S.base)abort();
	*S.top=T;
	S.top++;
	
}

memberTree* Pop(Stack &S)
{
	memberTree *T;
	if(S.base==S.top)return NULL;
	T=*--S.top;
	return T;
}
void Queue::IniQueue()
{
	front=rear=new Queue;
	front->next=NULL;
}

void Queue::EnQueue(Queue &Q,memberData *s)
{
	Queue*p= new Queue;
	p->node=s;
	p->next=NULL;
	rear->next=p;
	rear=p;
	Q.length++;
}

void Queue::DeQueue(Queue &Q)
{
	if(Q.front==Q.rear)return ;
	Queue * s=new Queue;
	s=Q.front->next;
	Q.front->next=s->next;
	if(s==Q.rear)Q.rear=Q.front;
	Q.length--;
}


void Queue::DestroyQueue(Queue &Q)
{
	while(Q.front)
	{
		Q.rear=Q.front->next;
		delete Q.front;
		Q.front=Q.rear;
	}
}