9.1 Activity-selection problem 9.2 Introduction to greedy solution 9.3 Steps of the greedy strategy 9.4 Knapsack problem 9.5 Huffman code

11.1 String matching problem 11.2 Naive string-matching algorithm 11.3 Rabin-Karp algorithm 11.4 Finite automaton 11.5 Knuth-Morris-Pratt algorithm

2.1 线性表的定义 2.2 线性表的顺序存储结构 2.3 线性表的链式存储结构

4.1 串的基本概念 4.2 串的存储结构 4.3 串的模式匹配

6.1 树 6.2 二叉树 6.3 哈夫曼树

12.1 Polynomial time algorithms 12.2 Undecidable 12.3 NP-complete 12.4 Approximation algorithms 12.5 Dealing with hard problems

8.1 Manufacturing problem 8.2 Matrix-chain multiplication 8.3 Elements of dynamic programming 8.4 Four steps of development 8.5 Longest common subsequence problem

数据结构与算法（PPT课件讲稿）Data Structures and Algorithms

西安电子科技大学：《数据结构与算法分析 Data Structure and Algorithm Analysis》课程教学资源（PPT课件讲稿）02 Trees（主讲：刘静）

西安电子科技大学：《数据结构与算法分析 Data Structure and Algorithm Analysis》课程教学资源（PPT课件讲稿）04 Priority Queues（Heaps）