本文介绍了栈作为后进先出（LIFO）数据结构的概念，并使用单链表来实现栈。栈的基本操作包括push（插入）、pop（删除最近插入的元素）和top（查看顶部元素）。在空栈上执行pop或top通常被视为错误，而push时空间不足则是实现错误。通过在链表头部插入和删除元素，实现了栈的功能。
A stack is a list with the restriction that inserts and deletes can be performed in only one position, namely the end of ofthe list called the top. The fundamental operations on a stack are push, which is equivalent to an insert, and pop, whichdeletes the most recently inserted element. The most recently inserted element can be examined prior to performing a pop by use of the top routine. A pop or top on an empty stack is generally considered an error in the stack ADT. On the other hand, running out of space when performing a push is an implementation error but not an ADT error.
Stacks are sometimes known as LIFO (last in, first out) lists. The model depicted in Figure 3.37 signifies only thatpushes are input operations and pops and tops are output. The usual operations to make
订阅专栏 解锁全文
扫一扫
4
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
