内容目录
第一天课程.............................................................................................................3 1.自我介绍 ........................................................................................................3 2.课程的简介 .....................................................................................................3 3.学习方法 ........................................................................................................3 1.数据结构的概念和分类 .....................................................................................4 1.1 基本概念 .............................................................................................4 1.2 基本分类/三个层次 ................................................................................4 1.3 逻辑结构的分类 ....................................................................................4 1.4 物理结构的分类 ....................................................................................5 1.5 逻辑结构和物理结构之间的关系 ..............................................................6 1.6 运算结构 .............................................................................................6 2.栈(Stack)的基本概念和基本操作 ......................................................................6 2.1 基本概念 .............................................................................................6 2.2 基本操作 .............................................................................................6 2.3 使用顺序结构实现栈的基本操作 ..............................................................6
第三天课程...........................................................................................................10 复习： ............................................................................................................10 1.队列 ............................................................................................................11 2.链表 ............................................................................................................11 2.1 基本概念 ...........................................................................................11 2.2 基本分类 ...........................................................................................11
第二天课程.............................................................................................................7 复习： ..............................................................................................................7 1.栈 .................................................................................................................9 2.队列(Queue) .................................................................................................9 2.1 基本概念 .............................................................................................9 2.2 基本操作 .............................................................................................9 2.3 使用顺序结构实现队列的基本操作 ...........................................................9
第五天课程...........................................................................................................18 复习： ............................................................................................................18 1.算法的概念和评价 .........................................................................................20 1.1 基本概念 ...........................................................................................20 1.2 评定标准 ...........................................................................................20 1.3 描述方式 ...........................................................................................20 2.常用的查找算法 ............................................................................................20 2.1 线性查找算法(顺序查找算法) ................................................................20 2.2 二分查找算法(折半查找算法) ................................................................21 3.常用的排序算法 ............................................................................................21 3.1 冒泡排序算法 .....................................................................................21 3.2 插入排序算法 .....................................................................................21
第四天课程...........................................................................................................13 复习： ............................................................................................................13 1.链表(List) ....................................................................................................14 2.二叉树(BinaryTree) .....................................................................................14 2.1 基本概念 ...........................................................................................14 2.2 基本特征 ...........................................................................................15 2.3 存储结构 ...........................................................................................15 2.4 基本操作 .............................................................16 2.5 遍历方式(重点) ...................................................................................16 2.6 有序二叉树 ........................................................................................16