目录
1.稀疏数组
2.队列(普通与环形)
3.单向链表
4.双向链表
5.约瑟夫环(环形链表)
6.栈
7.栈实现计算器
8.逆波兰计算器
9.迷宫回溯问题
10.八皇后问题
11.冒泡,选择,插入,希尔,快速,归并,基数排序
12.二分,插值,斐波那契查找
13.哈希表
14.二叉树
15.顺序存储二叉树
16.线索化二叉树
17.堆排序
18.哈夫曼树
19.哈夫曼编码以及压缩原理
20.二叉排序树(BST)
21.自平衡二叉树(AVL)
22.多叉树与图
23.图的DFS和BFS
1.稀疏数组
Java数据结构-稀疏数组的实现[用最简单的语言理解最复杂的问题]https://joelib.blog.csdn.net/article/details/123350802?spm=1001.2014.3001.5502
2.队列(普通与环形)
Java数据结构-普通队列 与 环形队列https://joelib.blog.csdn.net/article/details/123560844?spm=1001.2014.3001.5502
3.单向链表
惊了腾讯居然出这种单向链表面试题https://joelib.blog.csdn.net/article/details/123499914?spm=1001.2014.3001.5502
4.双向链表
双向链表的实现https://joelib.blog.csdn.net/article/details/123597112?spm=1001.2014.3001.5502
5.约瑟夫环(环形链表)
约瑟夫问题(Joseph环)https://joelib.blog.csdn.net/article/details/123414259?spm=1001.2014.3001.5502
6.栈
栈的实现https://joelib.blog.csdn.net/article/details/123590808?spm=1001.2014.3001.5502
7.栈实现计算器
用栈实现对表达式的求值https://joelib.blog.csdn.net/article/details/123332368?spm=1001.2014.3001.5502
8.逆波兰计算器
中缀转后缀与逆波兰表达式及其计算器完整版[面试必备]https://joelib.blog.csdn.net/article/details/123365348?spm=1001.2014.3001.5502
9.迷宫回溯问题
迷宫回溯问题https://joelib.blog.csdn.net/article/details/123476083?spm=1001.2014.3001.5502
10.八皇后问题
八皇后问题https://joelib.blog.csdn.net/article/details/123414169?spm=1001.2014.3001.5502
11.冒泡,选择,插入,希尔,快速,归并,基数排序
关于我要对排序来个乌鸦坐飞机这件事(Java与c++)(冒泡,选择,插入,希尔,归并,快速,基数https://joelib.blog.csdn.net/article/details/123623176?spm=1001.2014.3001.5502
12.二分,插值,斐波那契查找
光头强说今天讲的是顺序,二分,插值,斐波那契查找算法(支持多元素查找)https://joelib.blog.csdn.net/article/details/123848806?spm=1001.2014.3001.5502
13.哈希表
哈希表的实现(hash)https://joelib.blog.csdn.net/article/details/123757897?spm=1001.2014.3001.5502
14.二叉树
手砍二叉树https://joelib.blog.csdn.net/article/details/123770307?spm=1001.2014.3001.5502
15.顺序存储二叉树
顺序存储二叉树(光头强带你去砍树)https://joelib.blog.csdn.net/article/details/123798020?spm=1001.2014.3001.5502
16.线索化二叉树
线索化二叉树(强哥带你去搬树而且强哥说这有点烧脑)https://joelib.blog.csdn.net/article/details/123800535?spm=1001.2014.3001.5502
17.堆排序
玩转堆排序https://joelib.blog.csdn.net/article/details/124195200?spm=1001.2014.3001.5502
18.哈夫曼树
winRAR真难用,我决定自创一个(筑基期)适合无基础https://joelib.blog.csdn.net/article/details/123892758?spm=1001.2014.3001.5502winRAR真难用,我决定自创一个(结丹期) HuffmanTreehttps://joelib.blog.csdn.net/article/details/123905069?spm=1001.2014.3001.5502
19.哈夫曼编码以及压缩原理
winRAR真难用,我决定自创一个(元婴期) 压缩https://joelib.blog.csdn.net/article/details/123913609?spm=1001.2014.3001.5502
winRAR真难用,我决定自创一个(化神期) 解压https://joelib.blog.csdn.net/article/details/123948498?spm=1001.2014.3001.5502
winRAR真难用,我决定自创一个(炼虚期) 文件的压缩与解压 将色色一网打尽https://joelib.blog.csdn.net/article/details/123965081?spm=1001.2014.3001.5502
20.二叉排序树(BST)
我要种一棵BST(二叉排序树)https://joelib.blog.csdn.net/article/details/124116947?spm=1001.2014.3001.5502
21.自平衡二叉树(AVL)
问AVL为何物,我愿称之为转转转https://joelib.blog.csdn.net/article/details/124072495?spm=1001.2014.3001.5502
22.多叉树与图
B,B+,B*,2-3树的介绍与图的创建https://joelib.blog.csdn.net/article/details/124042140?spm=1001.2014.3001.5502
23.图的DFS和BFS
彻底搞懂图的广度优先算法https://joelib.blog.csdn.net/article/details/124017974?spm=1001.2014.3001.5502
彻底搞懂图的深度优先算法(Debug+图解+JavaDOC)https://joelib.blog.csdn.net/article/details/123978630?spm=1001.2014.3001.5502