线性表--链栈(十一)

typedef struct node
{
 int data;
 struct node * next;
}Node;

Node * InitStack()
{
 Node * Head = (Node *)malloc(sizeof(Node));
 Head->data = 0;
 Head->next = NULL;
 return Head;
}

int Push(Node * top, int x)
{
 Node * temp;
 temp = (Node *)malloc(sizeof(Node));
 if (temp == NULL)return(false);
 temp->data = x;
 temp->next = top->next;
 top->next = temp;
 return(true);
}

int Pop(Node * top, int *x)
{
 Node * temp;
 temp = top->next;
 if (temp == NULL)return(false);
 top->next = temp->next;
 *x = temp->data;
 free(temp);
 return(true);
}