第02章基本数据构stacksqueuesliststrees.pptVIP

  • 2
  • 0
  • 约1.04万字
  • 约 30页
  • 2018-12-22 发布于福建
  • 举报
第02章基本数据构stacksqueuesliststrees

Elementary Data Structures Elementary Data Structures Stacks, Queues, Lists Amortized analysis Trees The Stack ADT (§2.1.1) The Stack ADT stores arbitrary objects Insertions and deletions follow the last-in first-out scheme Think of a spring-loaded plate dispenser Main stack operations: push(object): inserts an element object pop(): removes and returns the last inserted element Auxiliary stack operations: object top(): returns the last inserted element without removing it integer size(): returns the number of elements stored boolean isEmpty(): indicates whether no elements are stored Applica

文档评论(0)

1亿VIP精品文档

相关文档