栈的插入删除

#include<stdio.h>
#include<stdlib.h>
#define SeqstackMaxse 1000
#define TESTER_HAND printf("\n=====%s======\n",__FUNCTION__);
typedef char  SeqstackType;
typedef struct Seqstack{
SeqstackType* data;
int capacity;
int  size;
}Seqstack;
void SeqstackInit(Seqstack*q);
void SeqstackDestroy(Seqstack*q);
void Seqstackpush(Seqstack *q, SeqstackType value);
void Seqstackpop(Seqstack *q);
SeqstackType SeqstackTopvalue(Seqstack *q);
void SeqstackEmpty(Seqstack* q);

void SeqstackPrint(Seqstack* q,char* msg);

#include"seqstack.h"
void SeqstackInit(Seqstack* q)
{
if (q == NULL)
{
return;
}
q->data = (SeqstackType*)malloc(sizeof(SeqstackType)* SeqstackMaxse);
q->capacity = SeqstackMaxse;
q->size = 0;
return ;
}
void SeqstackDestroy(Seqstack*q)
{
if (q == NULL)
{
return;
}
q->data = (SeqstackType*)malloc(sizeof(SeqstackType)* SeqstackMaxse);
q->capacity = SeqstackMaxse;
q->size = 0;
return;
}


void Seqstackpush(Seqstack *q, SeqstackType value)
{
if (q == NULL)
{
return;
}
if (q->size == q->capacity)
{
SeqstackType* str = NULL;
str = (SeqstackType*)realloc(q->data, sizeof(SeqstackType)*(q->capacity));
q->data = str;
}
q->data[q->size++] = value;


}
void Seqstackpop(Seqstack *q)
{
if (q == NULL)
{
return;   
}
if (q->size == NULL)
{
printf("栈已经为空");
return;
}
--q->size;
}
SeqstackType SeqstackTopvalue(Seqstack *q)
{
if (q == NULL)
{
return;
}
if (q->size == 0)
{
return 0;
}
return q->data[(q->size) - 1];
}
void SeqstackEmpty(Seqstack* q)
{
if (q == NULL)
{
return;
}
q->capacity = 0;
q->size = 0;
q->data == NULL;
}
void SeqstackPrint(Seqstack* q,char* msg)
{
printf("\n\n[%s]\n", msg);
if (q == NULL)
{
return;
}
if (q->size == 0)
{
return 0;
}
int i = 0;
for (i = q->size-1; i >= 0; i--)
{
printf("[%c]", q->data[i]);
}

}

#include"seqstack.h"
int main()
{
Seqstack mystack;
SeqstackInit(&mystack);
Seqstackpush(&mystack,'a');
Seqstackpush(&mystack,'b');
Seqstackpush(&mystack,'c');
Seqstackpush(&mystack, 'd');
SeqstackPrint(&mystack, "插入四个元素");
Seqstackpop(&mystack);
Seqstackpop(&mystack);
SeqstackPrint(&mystack, "栈顶删除两个元素");
SeqstackTopvalue(&mystack);
SeqstackPrint(&mystack, "取栈顶元素");
SeqstackEmpty(&mystack);
SeqstackPrint(&mystack, "清空元素");
return 0;
}