# data-structure-study
基于《大话数据结构》进行数据结构的学习
## 线性表
- [单链表](https://github.com/Nate-yu/data-structure-study/blob/master/linear_list/link_list.cpp)
- [栈的顺序存储结构](https://github.com/Nate-yu/data-structure-study/blob/master/linear_list/sq_stack.cpp)
- [两栈共享空间](https://github.com/Nate-yu/data-structure-study/blob/master/linear_list/sq_double_stack.cpp)
- [栈的链式存储结构](https://github.com/Nate-yu/data-structure-study/blob/master/linear_list/link_stack.cpp)
- [循环队列的顺序存储](https://github.com/Nate-yu/data-structure-study/blob/master/linear_list/sq_queue.cpp)
- [队列的链表结构](https://github.com/Nate-yu/data-structure-study/blob/master/linear_list/link_queue.cpp)
## 串
- [查找字符子串位置](https://github.com/Nate-yu/data-structure-study/blob/master/string/compare_string.cpp)
- [KMP字符串匹配](https://github.com/Nate-yu/data-structure-study/blob/master/string/kmp.cpp)
## 树
- [树的各种存储结构](https://github.com/Nate-yu/data-structure-study/blob/master/tree/tree_struct.cpp)
- [二叉树的创建与遍历](https://github.com/Nate-yu/data-structure-study/blob/master/tree/bi_tree.cpp)
## 图
- [无向图的邻接矩阵存储结构](https://github.com/Nate-yu/data-structure-study/blob/master/graph/m_graph.cpp)
- [无向图的邻接表存储结构](https://github.com/Nate-yu/data-structure-study/blob/master/graph/graph_adj_list.cpp)
- [图的邻接矩阵深度优先遍历操作](https://github.com/Nate-yu/data-structure-study/blob/master/graph/dfs.cpp)
- [图的邻接表深度优先遍历操作](https://github.com/Nate-yu/data-structure-study/blob/master/graph/dfs_adj_list.cpp)
## 查找
- [二分查找](https://github.com/Nate-yu/data-structure-study/blob/master/search/binary_search.cpp)
## 排序
- [冒泡排序](https://github.com/Nate-yu/data-structure-study/blob/master/sort/bubble_sort.cpp)