数据结构与算法课的知识点较为零散。一些知识点之间存在依赖关系，但从大体上讲，各部分知识点又较为独立。为了大家按照更省力的顺序阅读这些复习资料，这篇阅读指南给出了一个推荐的顺序。
flowchart TD
comp["计算理论"]
dc["分治"]
sorting["排序"]
hash["哈希"]
greedy["贪心"]
DP["动态规划"]
search["搜索算法"]
graphT["图论"]
graphAlgo["图上算法"]
treeAlgo["树上算法"]
treeDS["树形数据结构"]
linear["线性数据结构"]
comp --> search
comp --> dc
dc --> sorting
sorting --> hash
hash --> sorting
search --> DP
greedy --> DP
search ~~~ greedy
greedy --> graphAlgo
search --> graphT --> graphAlgo
graphT --> treeAlgo --> treeDS
search --> linear
linear --> search
click comp href "https://blog.leosrealms.top/blog/miscellaneous/data-structure/2026-05-25-computational-theory" _blank
click dc href "https://blog.leosrealms.top/blog/miscellaneous/data-structure/2026-05-28-divide-and-conquer" _blank
click sorting href "https://blog.leosrealms.top/blog/miscellaneous/data-structure/2026-05-25-sorting" _blank
click hash href "https://blog.leosrealms.top/blog/miscellaneous/data-structure/2026-05-24-hash" _blank
click greedy href "https://blog.leosrealms.top/blog/miscellaneous/data-structure/2026-05-23-greedy" _blank
click DP href "https://blog.leosrealms.top/blog/miscellaneous/data-structure/2026-05-27-dynamic-programming" _blank
click search href "https://blog.leosrealms.top/blog/miscellaneous/data-structure/2026-05-23-search-algorithms" _blank
click graphT href "https://blog.leosrealms.top/blog/miscellaneous/data-structure/2026-05-27-graph-theory" _blank
click graphAlgo href "https://blog.leosrealms.top/blog/miscellaneous/data-structure/2026-05-27-algorithms-on-the-graph" _blank
click treeAlgo href "https://blog.leosrealms.top/blog/miscellaneous/data-structure/2026-05-27-algorithms-on-the-tree" _blank
click treeDS href "https://blog.leosrealms.top/blog/miscellaneous/data-structure/2026-05-25-tree-like-data-structure" _blank
click linear href "https://blog.leosrealms.top/blog/miscellaneous/data-structure/2026-05-25-linear-data-structure" _blank
有相互连边的表示两个知识点有相互关联，推荐对比阅读。