#include<stdio.h>#include<malloc.h>#include<stdlib.h>typedef struct Node{ int data; struct Node * pNext;}NODE,* PNODE;typedef struct Stack{ PNODE pTop; PNODE pBottom;}STACK,* PSTACK;void init(PSTACK);void push(PSTACK, int);void traverse(PSTACK);int main(void){STACK S;init(&S);push(&S, 1);push(&S, 2);push(&S, 3);push(&S, 4);push(&S, 5);push(&S, 6);traverse(&S);return 0;}void init(PSTACK pS){ pS->pTop = (PNODE)malloc(sizeof(NODE)); if (NULL == pS->pTop) { printf("动态内存分配失败"); exit (-1); } else { pS -> pBottom = pS->pTop; pS->pTop->pNext = NULL; }}void push(PSTACK pS, int val){ PNODE pNew = (PNODE)malloc(sizeof(NODE)); pNew->data = val; pNew->pNext = pS->pTop; pS->pTop = pNew; return;}void travrese(PSTACK pS){ PNODE p = pS->pTop; while (p != pS->pBottom) { printf("%d", p->data); p = p->pNext; } printf("\n"); return;}我想问一下是怎么回事，要怎么改才能解决