◼ 树的基本概念 ◼ 二叉树 ◼ 二叉树的存储表示 ◼ 二叉树的遍历及其应用 ◼ 二叉树遍历的非递归算法 ◼ 二叉树的计数 ◼ 树与二叉树的转换 ◼ 堆 ◼ Huffman树及其应用

7.1 树 7.2 二叉树 7.3 二叉树的设计与实现 7.4 遍历二叉树和线索二叉树 7.5 赫夫曼树及其应用 7.6 树与二叉树的转换

7.1 树 7.2 二叉树 7.3 二叉树的设计与实现 7.4 遍历二叉树和线索二叉树 7.5 赫夫曼树及其应用 7.6 树与二叉树的转换

7.1 树 7.2 二叉树 7.3 二叉树的设计与实现 7.4 遍历二叉树和线索二叉树 7.5 赫夫曼树及其应用 7.6 树与二叉树的转换

7.1 树 7.2 二叉树 7.3 二叉树的设计与实现 7.4 遍历二叉树和线索二叉树 7.5 赫夫曼树及其应用 7.6 树与二叉树的转换

7.1 树 7.2 二叉树 7.3 二叉树的设计与实现 7.4 遍历二叉树和线索二叉树 7.5 赫夫曼树及其应用 7.6 树与二叉树的转换

11.1 Binary Search Trees 1.Definition: A binary search tree is a binary tree that may be empty. nonempty binary search tree satisfies the following properties: 1)Every element has a key and no two elements have the same key: therefore,all keys are distinct

7.1 基本概念 7.2 三种Ｏ(n2)的简单排序 7.3 Shell排序 7.4 基于分治法的排序 7.5 堆排序 7.6 分配排序和基数排序 7.7 排序算法的理论和实验时间代价 7.8 排序问题的下限

7.1 Dictionaries A dictionary is a collection of elements each element has a field called key, and no two elements have the same key value. Operations: Insert(x): insert an element with a specified key value Search(k,x): search an element with a specified key

6.1 Definition Definition: A queue is a linear list in which additions and deletions take place at different ends. It is also called a first-in-first-out list. The end at which new elements are added is called the rear. The end from which old elements are deleted is called the front