【数据结构】栈链式存储的实现_链式存储栈的实现-优快云博客

本文链接：https://blog.youkuaiyun.com/zhangxiafll/article/details/82261024

博客围绕数据结构中栈的链式存储实现展开。介绍了栈先进后出、仅栈顶可访问的特点，指出栈的链式存储结构是单链表，即链栈，且插入和删除操作只能在栈顶进行。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

【数据结构】栈链式存储的实现

//堆栈的链式存储实现
#include<iostream>
using namespace std;

typedef int element;
typedef struct Node {
    element data;
    struct Node *next;
}linkstack;


void Initial(linkstack *s)
{
    s->next = NULL;
}
//入栈
void push(element item, linkstack *s)
{
    Node *tmp;
    tmp = new Node;
    tmp->data = item;
    tmp->next = s->next;//注意指针顺序
    s->next = tmp;
}
//出栈
element pop(linkstack *s)
{
    if (s->next == NULL)
    {
        cout << "栈为空，无法出栈" << endl;
    }
    else
    {
        Node *tmp;
        tmp = s->next;
        element item = tmp->data;
        cout << "出栈元素为：" << item << endl;
        s->next = tmp->next;
        delete tmp;
        return 0;
    }
    
}

//栈的遍历
void visit(linkstack *s)
{
    if (s->next == NULL)
    {
        cout << "栈为空，无法出栈" << endl;
    }
    else
    {
        Node *tmp;
        element e;
        tmp = s->next;
        cout << "栈中元素为：";
        while (tmp)
        {
            e = tmp->data;
             cout << e;
            tmp = tmp->next;
        }
    }
}

void main()
{

    linkstack s;
    Initial(&s);
    int i, count, count1, num2;
    element num;
    cout << "请输入入栈的个数：";
    cin >> count;
    cout << "请输入入栈元素：" << endl;
    for (i = 0;i<count;i++)
    {
        cin >> num;
        push(num,&s);
    }
    cout << "请输入出栈的个数：";
    cin >> count1;
    for (i = 0;i<count1;i++)
    {
        pop(&s);
    }
    cout << "-----------"<<endl;
    visit(&s);
    cout << endl;
}