一个数组实现两个堆栈

//一个数组实现两个堆栈 
#include <stdio.h>
#include <stdlib.h>
#define ERROR -100000
typedef int ElementType; 
typedef int Position;
typedef struct SNode *PtrToSNode;
struct SNode{
	ElementType *Data;
	Position Top1;
	Position Top2;
	int MaxSize;
}; 
typedef PtrToSNode Stack;
Stack CreateStack(int MaxSize)
{
	Stack S=(Stack)malloc(sizeof(struct SNode));
	S->Data=(ElementType *)malloc(MaxSize*sizeof(int));
	S->Top1=-1;
	S->Top2=MaxSize;
	S->MaxSize=MaxSize;
	return S;
} 
bool Push(Stack S,ElementType X,int Tag)
{
	if(S->Top2-S->Top1==1){
		printf("堆栈满。\n");
		return false; 
	}
	else{
		if(Tag==1)
			S->Data[++S->Top1]=X;
		else
			S->Data[--S->Top2]=X;
		return true;	
	}
}
ElementType Pop(Stack S,int Tag){
	if(Tag==1){
		if(S->Top1==-1){
			printf("堆栈空。\n");
			return ERROR;
		}
		else return S->Data[S->Top1--];
	}
	else{
		if(S->Top2==S->MaxSize){
			printf("堆栈空。\n");
			return ERROR;			
		}
		else return S->Data[S->Top2++];
	}
}
void Print(Stack S){
	if(S->Top1==0)
		printf("一号堆栈为空");
	else{
		printf("一号堆栈：");
		for(int i=0;i<=S->Top1;i++)
			printf("%d ",S->Data[i]);
	} 
	printf("\n");
	if(S->Top2==S->MaxSize)
		printf("二号堆栈为空");
	else{
		printf("二号堆栈："); 
		for(int i=S->MaxSize-1;i>=S->Top2;i--)
			printf("%d ",S->Data[i]);
	} 
	printf("\n");
}

int main()
{
	Stack S=CreateStack(20);
	printf("测试Push函数：\n");
	for(int i=0;i<10;i++){
		Push(S,2*i,1);
		Push(S,3*i,2);
	}
	//printf("%d\n",S->Data[19]);
	Print(S);
	printf("测试Pop函数：\n");
	printf("Pop出的一号堆栈元素等于%d\n",Pop(S,1));
	printf("Pop出的二号堆栈元素等于%d\n",Pop(S,2));
	Print(S);
	return 0;
}