CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-05-03 10:50:41 +08:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2023-08-29 20:57:26 +08:00
parent 6ae6c480e0
commit 8c4d24795c
32 changed files with 574 additions and 278 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
chapter_tree/summary/index.html
View File

@@ -1511,8 +1511,15 @@
<ul class="md-nav__list" data-md-component="toc" data-md-scrollfix>
<li class="md-nav__item">
<a href="#761-q-a" class="md-nav__link">
7.6.1 &nbsp; Q &amp; A
<a href="#1" class="md-nav__link">
1. &nbsp; 重点回顾
</a>
</li>
<li class="md-nav__item">
<a href="#2-q-a" class="md-nav__link">
2. &nbsp; Q &amp; A
</a>
</li>
@@ -3398,8 +3405,15 @@
<ul class="md-nav__list" data-md-component="toc" data-md-scrollfix>
<li class="md-nav__item">
<a href="#761-q-a" class="md-nav__link">
7.6.1 &nbsp; Q &amp; A
<a href="#1" class="md-nav__link">
1. &nbsp; 重点回顾
</a>
</li>
<li class="md-nav__item">
<a href="#2-q-a" class="md-nav__link">
2. &nbsp; Q &amp; A
</a>
</li>
@@ -3428,6 +3442,7 @@
<h1 id="76">7.6 &nbsp; 小结<a class="headerlink" href="#76" title="Permanent link">&para;</a></h1>
<h3 id="1">1. &nbsp; 重点回顾<a class="headerlink" href="#1" title="Permanent link">&para;</a></h3>
<ul>
<li>二叉树是一种非线性数据结构，体现“一分为二”的分治逻辑。每个二叉树节点包含一个值以及两个指针，分别指向其左子节点和右子节点。</li>
<li>对于二叉树中的某个节点，其左（右）子节点及其以下形成的树被称为该节点的左（右）子树。</li>
@@ -3441,7 +3456,7 @@
<li>AVL 树，也称为平衡二叉搜索树，它通过旋转操作，确保在不断插入和删除节点后，树仍然保持平衡。</li>
<li>AVL 树的旋转操作包括右旋、左旋、先右旋再左旋、先左旋再右旋。在插入或删除节点后，AVL 树会从底向顶执行旋转操作，使树重新恢复平衡。</li>
</ul>
<h2 id="761-q-a">7.6.1 &nbsp; Q &amp; A<a class="headerlink" href="#761-q-a" title="Permanent link">&para;</a></h2>
<h3 id="2-q-a">2. &nbsp; Q &amp; A<a class="headerlink" href="#2-q-a" title="Permanent link">&para;</a></h3>
<div class="admonition question">
<p class="admonition-title">对于只有一个节点的二叉树，树的高度和根节点的深度都是 <span class="arithmatex">\(0\)</span> 吗？</p>
<p>是的，因为高度和深度通常定义为“走过边的数量”。</p>