◼ 3.1 栈(Stack) ◼ 3.2 队列(Queue) ◼ 3.3 栈和队列的比较

北京大学：《数据结构与算法》精品课程教学资源（教学大纲）

8.1 组合变形的概念及工程实例 8.2 两相互垂直平面内的弯曲 8.3 拉伸（压缩）与弯曲 8.4 扭转与弯曲 8.5 连接件的实用计算法 8.6 铆钉连接的计算

1. 数据结构概述 2. 什么是数据结构 3. 算法

1. Orchards, Trees, and Binary Trees 2. Lexicographic Search Trees: Tries 3. External Searching: B-Trees 4. Red-Black Trees Pointers and Pitfalls

1. Introduction: Breaking the lgn Barrier 2. Rectangular Arrays 3. Tables of Various Shapes 4. Tables: A New Abstract Data Type 5. Application: Radix Sort

1. Introduction, Notation 2. Sequential Search 3. Binary Search 4. Comparison Trees 5. Lower Bounds 6. Asymptotic 7. Pointers and Pitfalls

1. Introduction to Recursion 2. Principles of Recursion 3. Backtracking: Postponing the Work 4. Tree-Structured Programs: Look-Ahead in Games 5. Pointers and Pitfalls

1. Specifications for Queues 2. Implementation of Queues 3. Contiguous Queues in C++ 4. Demonstration and Testing 5. Application: Airport Simulation 6. Pointers and Pitfalls

1. Introduction : Problems with large programs 2.The Game of Life (a continuing example) 3. Programming style 4. Coding, Testing ,and Further Refinement 5. Program Maintenance 6. Preview (a) Software Engineering (b) Problem Analysis (c) Requirements Specification (d) Coding 7. Pointers and Pitfalls 8. References