用链表实现栈，但是输出时什么也没有

Question

#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>

struct Node
{
    int data;
    struct Node *link;
};

struct Node *top = NULL;

void Push(int);
void Pop();
void Print();

int main(void)
{
    Push(3);
    Push(6);
    Print();
    Push(5);
    Pop;
    Push(1);
    Print();
    return 0;
}

void Push(int i)
{
    struct Node *temp = (struct Node*)malloc(sizeof(struct Node));
    temp->data = i;
    temp->link = top->link;
    top = temp;
}

void Pop()
{
    struct Node* temp;
    if(top == NULL) return;
    temp = top;
    top = top->link;
    free(temp); 
}

void Print()
{
    struct Node* p = top;
    if(p->link != NULL)
    {
        printf("Stack: \n");
        printf("%d\n",p->data);
        p = p->link;
    }
    return;
}

Answer 1

改动处见注释，供参考：

#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>

struct Node
{
    int data;
    struct Node *link;
};

struct Node *top = NULL;

void Push(int);
void Pop();
void Print();

int main(void)
{
    Push(3);
    Push(6);
    Print();

    Push(5);
    Pop(); // Pop;  修改
    Push(1);
    Print();

    return 0;
}

void Push(int i)
{
    struct Node *temp = (struct Node*)malloc(sizeof(struct Node));
    temp->data = i;
    temp->link = top;  //temp->link = top->link; 修改
    top = temp;
}

void Pop()
{
    struct Node* temp;
    if(top == NULL) return;
    temp = top;
    top = top->link;
    free(temp);
}

void Print()
{
    struct Node* p = top;
    printf("Stack:");    //修改
    while (p)  //if(p->link != NULL) 修改
    {
        printf("%d ",p->data);
        p = p->link;
    }
    printf("\n"); //修改
    return;
}