链接栈操作

//链接栈
struct node
{
 int data;
 node* next;
};

//向t指向的链接栈，入栈x
void push(node* &t,int x)
{
 node temp = new node();
 temp.data = x;
 temp.next = t;
 t = &temp;
}

//返回值为出栈的元素的值
int pop(node* &t)
{
 if(t == NULL)
 {
  return -1;
 }
 else
 {
  node* p = t;
  t = t->next;
  int iReturn = p->data;
  delete p;
  return iReturn;
 }
}