About the sequence stack initialization, into the stack, out of the stack, stack full, empty stack operation

This program is run under VC environment. Sequential stacks are relatively simple. This program simply deletes the data directly after inserting a data. Please forgive me for not being perfect.


seqstack.h files.
#include <stdio.h>
#include <stdlib.h>


#define MAXSIZE 50


#define FALSE 0;
#define TRUE 1;


typedef struct{
int data[maxsize];
int top;
}seqstack;


Seqstack.cpp files.
#include "Seqstack.h"


Initialization of sequential stacks
int Initseqstack (Seqstack *s) {
s->top=-1;

return True;
}


Judgment Stack Full
int Isfull (Seqstack s) {
if (s.top==maxsize-1) {
return True;
}else{
return False;
}
}


Judge Stack Empty
int IsEmpty (Seqstack s) {
if (s.top==-1) {
return True;
}else{
return False;
}
}


Into the stack
int push (Seqstack *s,int data) {
if (Isfull (*s)) {//stack full cannot be inserted
return False;
}else{
s->data[++ (s->top)]=data;

return True;
}

}


Out Stack
int pop (Seqstack *s,int *data) {
if (IsEmpty (*s)) {
return False;
}else{
(*data) =s->data[(s->top)-];


return True;
}
}






void Main () {
Seqstack s;
int data;


Initseqstack (&s);


printf ("Enter the data to be inserted:");
scanf ("%d", &data);


if (push (&s,data)) {
printf ("Insert data successfully.") ");
}else{
printf ("The order stack is full.) ");
}


printf ("\ n");


if (pop (&s,&data)) {
printf ("Removed data is:%d", data);
}else{
printf ("Sequential stack is empty.) ");
}


printf ("\ n");
}


The results of the operation are as follows:
Please enter the data you want to insert: 23
Successfully inserted data.
The deleted data is: 23
Press any key to continue