Question

请教一道C语言的数据结构题目~

#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10
typedef struct{
SElemType *base;
SElemType *top;
int stacksize;
}SqStack;

Status InitStack(SqStack *s)
{s->base=(SElemType *)malloc(STACK_INIT_SIZE *sizeof(SElemType));
if(!s->base) exit(OVERFLOW);
____________________________;
s->stacksize=STACK_INIT_SIZE;
return OK;
}

Status Push(SqStack *s,SElemType e)
{if(s->top-s->base>s->stacksize){
s->base=(SElemType *)realloc(s->base,(s->stacksize+STACKINCREMENT) *sizeof(SElemType));
if(!s->base) exit(OVERFLOW);
s->top=s->base+s->stacksize;
s->stacksize+=STACKINCREMENT;
}
_______________________________;
return OK;
}
Status Pop(SqStack *s,SElemType *e){
if(s->top==s->base) return ERROR;
______________________________;
return OK;
}
SElemType GetTop(SqStack S)
{SElemType e;
______________________________;
return e;
}
Status StackEmpty(SqStack *s)
{
if(________________________________) return TRUE;
else return FALSE;
}
Status DestroyStack(SqStack *s)
{
free(s->base);s->base=NULL;
s->top=NULL;
s->stacksize=0;
return OK;
}
Status ClearStack(SqStack *s)
{____________________________;
s->stacksize=STACK_INIT_SIZE;
return OK;
}

Answer 1

Status InitStack(SqStack *s)
{
s->base=(SElemType *)malloc(STACK_INIT_SIZE *sizeof(SElemType));
if(!s->base) exit(OVERFLOW);
s->top=s->base;//____________________________;
s->stacksize=STACK_INIT_SIZE;
return OK;
}

Status Push(SqStack *s,SElemType e)
{
if(s->top-s->base>s->stacksize)
{
s->base=(SElemType *)realloc(s->base,(s->stacksize+STACKINCREMENT) *sizeof(SElemType));
if(!s->base) exit(OVERFLOW);
s->top=s->base+s->stacksize;
s->stacksize+=STACKINCREMENT;
}
*(++s->top)=e;//_______________________________;
return OK;
}
Status Pop(SqStack *s,SElemType *e)
{
if(s->top==s->base) return ERROR;
*e=*(s->top--);//______________________________;
return OK;
}
SElemType GetTop(SqStack S)
{
SElemType e;
e=*(S.top);//______________________________;
return e;
}
Status StackEmpty(SqStack *s)
{

//if(________________________________) return TRUE;
if(s->base==s->top) return TRUE;
else return FALSE;
}
Status DestroyStack(SqStack *s)
{

free(s->base);s->base=NULL;
s->top=NULL;
s->stacksize=0;
return OK;
}
Status ClearStack(SqStack *s)
{
s->top=s->base;//____________________________;
s->stacksize=STACK_INIT_SIZE;
return OK;
}

Answer 2

Status CreateBiTree(BiTree *T)
{
TElemType ch;
scanf("%c",&ch);
if(ch==' ') *T=NULL;
else
{
*T=(BiTNode *)malloc(sizeof(BiTNode));
if(!*T) exit(OVERFLOW);
T->data=ch;
CreateBiTree(T->lchild);
CreateBiTree(T->rchild);
}
return OK;
}
Status InOrderTraverse(BiTree T,Status(* Visit)(TElemType))
{
if(T){
if(PreOrderTraverse(T->lchild,Visit));
if(Visit(T->data))
if(PreOrderTraverse(T->rchild,Visit)) return OK;
return ERROR;
}else return OK;
}
Status BackOrderTraverse(BiTree T,Status(* Visit)(TElemType))
{
if(T){
if(PreOrderTraverse(T->lchild,Visit));
if(PreOrderTraverse(T->rchild,Visit));
if(Visit(T->data))return OK;
return ERROR;
}else return OK;
}