CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-13 17:09:46 +08:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2023-09-22 13:08:10 +08:00
parent 5bb9f76fbc
commit 6fffa33695
107 changed files with 2561 additions and 19178 deletions
Download Patch File Download Diff File Expand all files Collapse all files

224
chapter_tree/binary_tree_traversal/index.html
View File

@@ -60,7 +60,18 @@
</head>
<link href="../../assets/stylesheets/glightbox.min.css" rel="stylesheet"/><style>
html.glightbox-open { overflow: initial; height: 100%; }
.gslide-title { margin-top: 0px; user-select: text; }
.gslide-desc { color: #666; user-select: text; }
.gslide-image img { background: white; }
.gscrollbar-fixer { padding-right: 15px; }
.gdesc-inner { font-size: 0.75rem; }
body[data-md-color-scheme="slate"] .gdesc-inner { background: var(--md-default-bg-color);}
body[data-md-color-scheme="slate"] .gslide-title { color: var(--md-default-fg-color);}
body[data-md-color-scheme="slate"] .gslide-desc { color: var(--md-default-fg-color);}
</style> <script src="../../assets/javascripts/glightbox.min.js"></script></head>
@@ -1971,14 +1982,6 @@
10.2 &nbsp; 二分查找插入点
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -1999,14 +2002,6 @@
10.3 &nbsp; 二分查找边界
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -2426,14 +2421,6 @@
第 12 章 &nbsp; 分治
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
@@ -2465,14 +2452,6 @@
12.1 &nbsp; 分治算法
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -2493,14 +2472,6 @@
12.2 &nbsp; 分治搜索策略
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -2521,14 +2492,6 @@
12.3 &nbsp; 构建树问题
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -2549,14 +2512,6 @@
12.4 &nbsp; 汉诺塔问题
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -2577,14 +2532,6 @@
12.5 &nbsp; 小结
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -2816,14 +2763,6 @@
第 14 章 &nbsp; 动态规划
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
@@ -2855,14 +2794,6 @@
14.1 &nbsp; 初探动态规划
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -2883,14 +2814,6 @@
14.2 &nbsp; DP 问题特性
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -2911,14 +2834,6 @@
14.3 &nbsp; DP 解题思路
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -2939,14 +2854,6 @@
14.4 &nbsp; 0-1 背包问题
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -2967,14 +2874,6 @@
14.5 &nbsp; 完全背包问题
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -2995,14 +2894,6 @@
14.6 &nbsp; 编辑距离问题
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -3023,14 +2914,6 @@
14.7 &nbsp; 小结
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -3089,14 +2972,6 @@
第 15 章 &nbsp; 贪心
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
@@ -3128,14 +3003,6 @@
15.1 &nbsp; 贪心算法
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -3156,14 +3023,6 @@
15.2 &nbsp; 分数背包问题
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -3184,14 +3043,6 @@
15.3 &nbsp; 最大容量问题
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -3212,14 +3063,6 @@
15.4 &nbsp; 最大切分乘积问题
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -3240,14 +3083,6 @@
15.5 &nbsp; 小结
</span>
<span class="md-status md-status--new" title="最近添加">
</span>
</a>
</li>
@@ -3559,7 +3394,7 @@
<h2 id="721">7.2.1 &nbsp; 层序遍历<a class="headerlink" href="#721" title="Permanent link">&para;</a></h2>
<p>如图 7-9 所示，「层序遍历 level-order traversal」从顶部到底部逐层遍历二叉树，并在每一层按照从左到右的顺序访问节点。</p>
<p>层序遍历本质上属于「广度优先遍历 breadth-first traversal」，它体现了一种“一圈一圈向外扩展”的逐层遍历方式。</p>
<p><img alt="二叉树的层序遍历" src="../binary_tree_traversal.assets/binary_tree_bfs.png" /></p>
<p><a class="glightbox" href="../binary_tree_traversal.assets/binary_tree_bfs.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="二叉树的层序遍历" src="../binary_tree_traversal.assets/binary_tree_bfs.png" /></a></p>
<p align="center"> 图 7-9 &nbsp; 二叉树的层序遍历 </p>
<h3 id="1">1. &nbsp; 代码实现<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
@@ -3854,7 +3689,7 @@
<h2 id="722">7.2.2 &nbsp; 前序、中序、后序遍历<a class="headerlink" href="#722" title="Permanent link">&para;</a></h2>
<p>相应地，前序、中序和后序遍历都属于「深度优先遍历 depth-first traversal」，它体现了一种“先走到尽头，再回溯继续”的遍历方式。</p>
<p>图 7-10 展示了对二叉树进行深度优先遍历的工作原理。<strong>深度优先遍历就像是绕着整个二叉树的外围“走”一圈</strong>，在每个节点都会遇到三个位置，分别对应前序遍历、中序遍历和后序遍历。</p>
<p><img alt="二叉搜索树的前、中、后序遍历" src="../binary_tree_traversal.assets/binary_tree_dfs.png" /></p>
<p><a class="glightbox" href="../binary_tree_traversal.assets/binary_tree_dfs.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="二叉搜索树的前、中、后序遍历" src="../binary_tree_traversal.assets/binary_tree_dfs.png" /></a></p>
<p align="center"> 图 7-10 &nbsp; 二叉搜索树的前、中、后序遍历 </p>
<h3 id="1_1">1. &nbsp; 代码实现<a class="headerlink" href="#1_1" title="Permanent link">&para;</a></h3>
@@ -4262,37 +4097,37 @@
<div class="tabbed-set tabbed-alternate" data-tabs="3:11"><input checked="checked" id="__tabbed_3_1" name="__tabbed_3" type="radio" /><input id="__tabbed_3_2" name="__tabbed_3" type="radio" /><input id="__tabbed_3_3" name="__tabbed_3" type="radio" /><input id="__tabbed_3_4" name="__tabbed_3" type="radio" /><input id="__tabbed_3_5" name="__tabbed_3" type="radio" /><input id="__tabbed_3_6" name="__tabbed_3" type="radio" /><input id="__tabbed_3_7" name="__tabbed_3" type="radio" /><input id="__tabbed_3_8" name="__tabbed_3" type="radio" /><input id="__tabbed_3_9" name="__tabbed_3" type="radio" /><input id="__tabbed_3_10" name="__tabbed_3" type="radio" /><input id="__tabbed_3_11" name="__tabbed_3" type="radio" /><div class="tabbed-labels"><label for="__tabbed_3_1">&lt;1&gt;</label><label for="__tabbed_3_2">&lt;2&gt;</label><label for="__tabbed_3_3">&lt;3&gt;</label><label for="__tabbed_3_4">&lt;4&gt;</label><label for="__tabbed_3_5">&lt;5&gt;</label><label for="__tabbed_3_6">&lt;6&gt;</label><label for="__tabbed_3_7">&lt;7&gt;</label><label for="__tabbed_3_8">&lt;8&gt;</label><label for="__tabbed_3_9">&lt;9&gt;</label><label for="__tabbed_3_10">&lt;10&gt;</label><label for="__tabbed_3_11">&lt;11&gt;</label></div>
<div class="tabbed-content">
<div class="tabbed-block">
<p><img alt="前序遍历的递归过程" src="../binary_tree_traversal.assets/preorder_step1.png" /></p>
<p><a class="glightbox" href="../binary_tree_traversal.assets/preorder_step1.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="前序遍历的递归过程" src="../binary_tree_traversal.assets/preorder_step1.png" /></a></p>
</div>
<div class="tabbed-block">
<p><img alt="preorder_step2" src="../binary_tree_traversal.assets/preorder_step2.png" /></p>
<p><a class="glightbox" href="../binary_tree_traversal.assets/preorder_step2.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_step2" src="../binary_tree_traversal.assets/preorder_step2.png" /></a></p>
</div>
<div class="tabbed-block">
<p><img alt="preorder_step3" src="../binary_tree_traversal.assets/preorder_step3.png" /></p>
<p><a class="glightbox" href="../binary_tree_traversal.assets/preorder_step3.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_step3" src="../binary_tree_traversal.assets/preorder_step3.png" /></a></p>
</div>
<div class="tabbed-block">
<p><img alt="preorder_step4" src="../binary_tree_traversal.assets/preorder_step4.png" /></p>
<p><a class="glightbox" href="../binary_tree_traversal.assets/preorder_step4.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_step4" src="../binary_tree_traversal.assets/preorder_step4.png" /></a></p>
</div>
<div class="tabbed-block">
<p><img alt="preorder_step5" src="../binary_tree_traversal.assets/preorder_step5.png" /></p>
<p><a class="glightbox" href="../binary_tree_traversal.assets/preorder_step5.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_step5" src="../binary_tree_traversal.assets/preorder_step5.png" /></a></p>
</div>
<div class="tabbed-block">
<p><img alt="preorder_step6" src="../binary_tree_traversal.assets/preorder_step6.png" /></p>
<p><a class="glightbox" href="../binary_tree_traversal.assets/preorder_step6.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_step6" src="../binary_tree_traversal.assets/preorder_step6.png" /></a></p>
</div>
<div class="tabbed-block">
<p><img alt="preorder_step7" src="../binary_tree_traversal.assets/preorder_step7.png" /></p>
<p><a class="glightbox" href="../binary_tree_traversal.assets/preorder_step7.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_step7" src="../binary_tree_traversal.assets/preorder_step7.png" /></a></p>
</div>
<div class="tabbed-block">
<p><img alt="preorder_step8" src="../binary_tree_traversal.assets/preorder_step8.png" /></p>
<p><a class="glightbox" href="../binary_tree_traversal.assets/preorder_step8.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_step8" src="../binary_tree_traversal.assets/preorder_step8.png" /></a></p>
</div>
<div class="tabbed-block">
<p><img alt="preorder_step9" src="../binary_tree_traversal.assets/preorder_step9.png" /></p>
<p><a class="glightbox" href="../binary_tree_traversal.assets/preorder_step9.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_step9" src="../binary_tree_traversal.assets/preorder_step9.png" /></a></p>
</div>
<div class="tabbed-block">
<p><img alt="preorder_step10" src="../binary_tree_traversal.assets/preorder_step10.png" /></p>
<p><a class="glightbox" href="../binary_tree_traversal.assets/preorder_step10.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_step10" src="../binary_tree_traversal.assets/preorder_step10.png" /></a></p>
</div>
<div class="tabbed-block">
<p><img alt="preorder_step11" src="../binary_tree_traversal.assets/preorder_step11.png" /></p>
<p><a class="glightbox" href="../binary_tree_traversal.assets/preorder_step11.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="preorder_step11" src="../binary_tree_traversal.assets/preorder_step11.png" /></a></p>
</div>
</div>
</div>
@@ -4466,10 +4301,15 @@ aria-label="页脚"
<div class="md-copyright">
<div class="md-copyright__highlight">
Copyright &copy; 2023 Krahets
Copyright &copy; 2022 - 2023 Krahets
</div>
Made with
<a href="https://squidfunk.github.io/mkdocs-material/" target="_blank" rel="noopener">
Material for MkDocs
</a>
</div>
<!-- Social links -->
@@ -4538,5 +4378,5 @@ aria-label="页脚"
</body>
<script>document$.subscribe(() => {const lightbox = GLightbox({"touchNavigation": true, "loop": false, "zoomable": true, "draggable": false, "openEffect": "zoom", "closeEffect": "zoom", "slideEffect": "none"});})</script></body>
</html>