数据结构英文教学课件：chapter4 Stacks and Queues.pptVIP

下载本文档

16
0
约2.24万字
约 80页
2022-04-24 发布于安徽
举报
版权申诉

数据结构英文教学课件：chapter4 Stacks and Queues.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Data Structure Software College Northeastern University Chapter 4 Stacks and Queues Overview Stack Model Implementation of Stacks Applications of stacks Queue Models Array Implementation of Queues Applications of Queues Stack ADT A stack is a list in which insertion and deletion take place at the same end This end is called top The other end is called bottom Stacks are known as LIFO (Last In, First Out) lists. The last element inserted will be the first to be retrieved Data Structure -- Stacks Real life analogy: Elevator Dish holders (stacks) Typical uses of stacks: Balancing symbols for syntax checks (see notes) Prefix-/Postfix- calculators Data Structures -- Stacks Operations of Stack IsEmpty: return true if stack is empty, return false otherwise IsFull: return true if stack is full, return false otherwise top: return the element at the top of stack Push: add an element to the top of stack Pop: delete the element at the top of stack displayStack: print all the data in the stack Data Structure -- Stacks Stacks are known as LIFO (Last In, First Out) lists:The last element inserted will be the first to be retrieved, using Push and Pop Push Add an element to the top of the stack Pop Remove the element at the top of the stack Stack ADT Implementation of Stacks Any list implementation could be used to implement a stack Arrays - static: the size of stack is given initially Linked lists - dynamic: never become full We will explore implementations based on array and linked list Array Implementation of Stacks Attributes of Stack stacksize: the max size of stack top: the Address of the top element of stack base: points to structure storing elements of stack STL stack Adapter(deque) STL stack Adapter STL stack Adapter #include iostream #include string #include cstdlib #include stack using namespace std; int main(int argc, char* argv[]) { stackint s; s.push(1); s.pop(); s.push(10); s.push(11); cout s.top() endl;