https://github.com/yziyan/data_struct
数据结构
https://github.com/yziyan/data_struct
arraylist data-structures datastructures linked-list queue stack
Last synced: 9 months ago
JSON representation
数据结构
- Host: GitHub
- URL: https://github.com/yziyan/data_struct
- Owner: Yziyan
- Created: 2022-10-11T12:37:52.000Z (about 3 years ago)
- Default Branch: main
- Last Pushed: 2023-05-01T07:57:53.000Z (over 2 years ago)
- Last Synced: 2025-02-18T09:41:04.165Z (10 months ago)
- Topics: arraylist, data-structures, datastructures, linked-list, queue, stack
- Language: Java
- Homepage:
- Size: 353 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# 数据结构
## 一、线性表
* [01_线性表](https://github.com/Yziyan/data_struct/tree/main/01_%E6%95%B0%E7%BB%84%26%E9%93%BE%E8%A1%A8%26%E6%A0%88%26%E9%98%9F%E5%88%97)
* [**文章地址**](https://juejin.cn/post/7159955445266776071)
## 二、二叉树
### 代码目录
* [02_二叉搜索树](https://github.com/Yziyan/data_struct/tree/main/02_%E4%BA%8C%E5%8F%89%E6%A0%91/src/run/ciusyan/binarysearchtree)
* [03_AVL树](https://github.com/Yziyan/data_struct/tree/main/02_%E4%BA%8C%E5%8F%89%E6%A0%91/src/run/ciusyan/avltree)
* [04_红黑树](https://github.com/Yziyan/data_struct/tree/main/02_%E4%BA%8C%E5%8F%89%E6%A0%91/src/run/ciusyan/redblacktree)
### 文章地址
* [如何构建一棵二叉搜索树？](https://juejin.cn/post/7168286143430000671)
* [透过AVL树的实现，学习树的旋转](https://juejin.cn/post/7172467470928707591)
* [你心里有B树吗？](https://juejin.cn/post/7174639541272199226)
* [初识红黑树](https://juejin.cn/post/7176536651651350589)
* [红黑树的添加](https://juejin.cn/post/7177716251215527997)
* [红黑树的删除](https://juejin.cn/post/7179080837726470202)
## 三、Set集合
### 代码目录
[TreeSet](https://github.com/Yziyan/data_struct/tree/main/03_%E9%9B%86%E5%90%88/src/run/ciusyan/set)
### 文章地址
[TreeSet的实现](https://juejin.cn/post/7181469969736007738/)
## 四、映射
### 代码目录
[01_TreeMap](https://github.com/Yziyan/data_struct/tree/main/04_%E6%98%A0%E5%B0%84/src/run/ciusyan/map)
### 文章地址
[从零用红黑树实现TreeMap](https://juejin.cn/post/7180656499859914810/)