前言
欢迎订阅《零基础入门数据结构与算法》专栏!
本专栏主要分为五个部分:
① 重要基础知识点详解② 近百道练习题目详解
③ 数据结构与算法测试
④ 数据结构与算法实验
⑤ 数据结构与算法试卷
目录
第一部分:基础
第二部分:练习
Part 0:绪论
Part 1:顺序表
顺序表 | ||
1 | C语言实现顺序表的插入、删除 | https://want595.blog.csdn.net/article/details/126967798 |
2 | 顺序表基本练习-初始化、插入和输出 | https://want595.blog.csdn.net/article/details/127737121 |
3 | 顺序表基本练习-删除元素 | https://want595.blog.csdn.net/article/details/127737165 |
4 | 顺序表基本操作-查找 | https://want595.blog.csdn.net/article/details/127737191 |
5 | 顺序表删除重复元素 | https://want595.blog.csdn.net/article/details/126998125 |
6 | 顺序表实现集合并集 | https://want595.blog.csdn.net/article/details/127737454 |
7 | 顺序表元素循环左移(new) | https://want595.blog.csdn.net/article/details/128281975 |
8 | 删除顺序表中最小值 | https://want595.blog.csdn.net/article/details/126984319 |
9 | 递增顺序表插入 | https://want595.blog.csdn.net/article/details/126990708 |
10 | 将顺序表非零元素依次移到表的前端 | https://want595.blog.csdn.net/article/details/127737349 |
11 | 删除顺序表中第一个值等于x的元素 | https://want595.blog.csdn.net/article/details/127619864 |
12 | 在顺序表中,输入一个元素插入到原表的最小元素之前 | https://want595.blog.csdn.net/article/details/127365247 |
Part 2:链表
Part 3:栈与队列
栈与队列 | ||
1 | 栈的基本操作 | https://want595.blog.csdn.net/article/details/127029776 |
2 | 函数:判断表达式括弧是否匹配 | https://want595.blog.csdn.net/article/details/127385417 |
3 | 栈的应用-判断表达式括弧是否匹配(()、[]、{}) | https://want595.blog.csdn.net/article/details/127034244 |
4 | 数制转换(十进制转二进制) | https://want595.blog.csdn.net/article/details/127030116 |
5 | 纸条解密-栈的应用 | https://want595.blog.csdn.net/article/details/127972836 |
6 | 简单表达式计算 | https://want595.blog.csdn.net/article/details/127076506 |
7 | 浏览器中访问网页、回退及前进模拟 | https://want595.blog.csdn.net/article/details/127760635 |
8 | 舞伴配对模拟 | https://want595.blog.csdn.net/article/details/127856027 |
9 | 判断序列是否为正确的出栈序列 | https://want595.blog.csdn.net/article/details/128051502 |
10 | 链队列基本操作 | https://want595.blog.csdn.net/article/details/127504167 |
11 | 顺序循环队列的基本操作 | https://want595.blog.csdn.net/article/details/127504119 |
12 | 用尾指针标识的单循环链表实现队列r | https://want595.blog.csdn.net/article/details/127856588 |
Part 4:串
Part 5:矩阵
Part 6:树
树 | ||
1 | 二叉树的建立与遍历 | https://want595.blog.csdn.net/article/details/127460111 |
2 | 层次遍历二叉树 | https://want595.blog.csdn.net/article/details/127851432 |
3 | 计算二叉树的最大宽度 | https://want595.blog.csdn.net/article/details/127643826 |
4 | 查找二叉树指定结点,并输出以该结点为根的子树的深度 | https://want595.blog.csdn.net/article/details/127470043 |
5 | 计算二叉树的深度和叶子结点数 | https://want595.blog.csdn.net/article/details/127460472 |
6 | 交换二叉树中所有结点的左右结点 | https://want595.blog.csdn.net/article/details/127851496 |
7 | 非递归方式实现二叉树的四种遍历 | https://want595.blog.csdn.net/article/details/127817379 |
8 | 利用非递归遍历统计二叉树的结点数 | https://want595.blog.csdn.net/article/details/127851363 |
9 | 函数:先序输出叶结点 | https://want595.blog.csdn.net/article/details/128282061 |
10 | 哈夫曼树和哈夫曼编码 | https://want595.blog.csdn.net/article/details/127811626 |
11 | 哈夫曼的编码和解码过程 | https://want595.blog.csdn.net/article/details/127972747 |
Part 7:图
Part 8:查找
查找 | ||
1 | 查找-顺序查找 | https://want595.blog.csdn.net/article/details/128298940 |
2 | 查找-折半查找 | https://want595.blog.csdn.net/article/details/128154490 |
3 | 查找-二叉排序树 | https://want595.blog.csdn.net/article/details/128149201 |
Part 9:排序
第三部分:测试
第四部分:实验
第五部分:试卷
总结
我是一只有趣的兔子,感谢你的喜欢!