数据结构是计算机学科各专业的一门重要专业基础课程。本课程主要论述数据的逻辑结构、存储结构、算法设计以及算法评价四方面的内容，使学生对线性表、栈、队列、树、图等各种数据结构以及查找、排序等基础算法有深入的了解；还要求学生针对具体的工程问题，系统地掌握在不同的数据结构上进行有关算法设计的思想和技巧。数据结构是一门理论性和实践性都很强的课程。
Overview
Syllabus
- 1. Introduction
- 1.1 Introduction of Data Structure
- 1.2 Data Structure and Algorithm
- 1.3 Asymptotic Analysis
- 1.4 Simplifying Rules of Asymptotic Analysis
- 2. List
- 2.1 Introduction of List
- 2.2 Array based List
- 2.3 Insertion Operation on Array based List
- 2.4 Remove Operation on Array based List
- 2.5 Linked list
- 2.6 Insertion Operation on Linked list
- 2.7 Remove Operation on Linked list
- 2.8 SetPos Operation on Linked list
- 2.9 Stack
- 2.10 Application of Stack
- 2.11 Queue
- 3. Tree
- 3.1 Definition of Binary Tree
- 3.2 Implementation of Binary Tree
- 3.3 Traversal
- 3.4 Binary Search Tree
- 3.5 Search on BST
- 3.6 Insertion on BST
- 3.7 Introduction of Heap
- 3.8 Construction of Heap
- 3.9 Operations on Heap
- 3.10 General Tree
- 4. Search
- 4.1 Definition of Searching
- 4.2 Searching of Sorted Array
- 4.3 Definition of Hash Table
- 4.4 Collision in Hash Table
- 4.5 Extension of Linear Probing
- 4.6 Insertion Operation of Hash Table
- 4.7 Search Operation of Hash Table
- 5. Index
- 5.1 Introduction of Index
- 5.2 Linear Index
- 5.3 2-3 tree index
- 5.4 Implementation of 2-3 tree
- 5.5 B-Tree
- 5.6 Insertion Operation on B+ Tree
- 5.7 Deletion Operation on B+ Tree
- 6. Graph
- 6.1 Definition of Graph
- 6.2 Implementation of Graph
- 6.3 Adjacency Matrix
- 6.4 Adjacency List
- 6.5 Graph Traversal - DFS
- 6.6 Graph Traversal - BFS
- 6.7 Topological Sort
- 6.8 Shortest Path Problem
- 6.9 Single Source Shortest Path
- 6.10 Dijkstra Algorithm
- 7. Sorting
- 7.1 Sorting Problem
- 7.2 Insertion Sort
- 7.3 Selection Sort
- 7.4 Bubble Sort
- 7.5 Shell Sort
- 7.6 Quick Sort
- 7.7 Heap Sort
- 7.8 Comparison
Taught by
Jianming Lv, Jianwei Zhang, and Nanfeng Xiao
