Main topics Definition of graphs and some terminology Three common graph representations Some algorithms

9.1 Introduction A priority queue is a collection of zero or more elements. Each element has a priority or value

Two kinds of data structure Linear: list, stack, queue, string Non-linear: tree, graph

4.1 1D-Array 1. One-dimensional array 1D-array is a limited sequence composed of n (n20) elements which are of the same data type. For example:

2.1 Preface Performance of a program: the amount of computer memory and time needed to run a program We use two approaches to determine it: performance analysis performance measurement

The purpose and contents of the course Introduce most used data structures and algorithms Prerequisite of other courses Introduce algorithm analysis Review C++

可利用空间表、边界标识法、伙伴系统和无用 单元收集。 要求掌握可利用空间表及分配办法

▪ 树的概念和基本术语 ▪ 二叉树 ▪ 二叉树遍历 ▪ 二叉树的计数 ▪ 树与森林 ▪ 霍夫曼树

❖ 线性表 ❖ 顺序表 ❖ 链表 ❖ 顺序表与链表的比较

第8章查找 要点: 1、各种查找表元素如何组织; 2、各种查找方法的特征; 3、查找算法