#include<iostream>
using namespace std;

typedef struct Node
{
    char data;
    Node *pNext;
}NODE, *PNODE;

typedef struct Stack
{
    PNODE pTop;
    PNODE pBottom;
}STACK, *PSTACK;

void init(PSTACK pS);
void push(PSTACK pS);
void traverse(PSTACK pS);
int main()
{
    STACK S ;
    init(&S);
    push(&S);
    traverse(&S);
    return 0 ;
}

//栈的初始化
void init(PSTACK pS)
{
    pS -> pTop = new Node;

    if(NULL == pS -> pTop)
    {
        printf("动态内存分配失败！");
    }
    else
    {
        pS -> pBottom = pS -> pTop;
        pS -> pTop -> pNext = NULL;
    }

    return ;
}

//插入元素到栈顶
void push(PSTACK pS)
{
    char temp;
    do
    {
        cin>>temp;
        if(temp=='$')
        {
            PNODE r = pS -> pTop;
            temp = pS -> pTop -> data;
            pS -> pTop = r -> pNext;
            delete r;
        }
        if(temp!='#')
        {
            PNODE pNew = new Node;
            pNew -> data = temp;
            pNew -> pNext = pS -> pTop;
            pS -> pTop = pNew;
        }
    } while (temp!='#');

    return ;
}

//遍历栈S
void traverse(PSTACK pS)
{
    PNODE p = pS -> pTop;

    printf("栈内元素为：");
    while(p != pS -> pBottom)
    {
        cout<<p->data;
        p = p -> pNext;
    }

    printf("\n");
    return ;
}

这个代码意思是遇到#结束，遇到$就是压栈。比如输入11111$#，输出11111。

如果temp = pS -> pTop -> data;删去，输出就变成$1111，请问出了什么问题？
还有删除栈顶元素，一定要temp = pS -> pTop -> data;这句嘛？这句什么用？