链栈的进栈算法

你没说用C还是C++,如下是链栈的基本操作实例..以前的东西..
#include<iostream.h>
typedef struct stacknode{
int data;
struct stacknode *next;
}StackNode;
typedef struct{
StackNode *top; //栈顶指针
}LinkStack;
void InitStack(LinkStack *&S){
S=new LinkStack;
S->top =NULL;
}
void InitStackn(LinkStack *&S,int n){

StackNode *p;
int e;

p=new StackNode[n];
for(int i=0;i<n;i++){
cin>>e;
p[i].data=e;
p[i].next=S->top;//将新结点*p插入链栈头部
S->top=&p[i];
}
}

int StackEmpty(LinkStack *&S){
return S->top==NULL;
}
void Push(LinkSt