deploy

chapter_tree/binary_tree/index.html

@@ -3987,6 +3987,8 @@
 <p align="center"> 图：二叉树的最佳与最差结构 </p>
 
 <p>如下表所示，在最佳和最差结构下，二叉树的叶节点数量、节点总数、高度等达到极大或极小值。</p>
+<p align="center"> 表：二叉树的最佳与最差情况 </p>
+
 <div class="center-table">
 <table>
 <thead>
@@ -4003,17 +4005,17 @@
 <td><span class="arithmatex">\(1\)</span></td>
 </tr>
 <tr>
-<td>树的高度为 <span class="arithmatex">\(h\)</span> 时的叶节点数量</td>
+<td>高度 <span class="arithmatex">\(h\)</span> 树的叶节点数量</td>
 <td><span class="arithmatex">\(2^h\)</span></td>
 <td><span class="arithmatex">\(1\)</span></td>
 </tr>
 <tr>
-<td>树的高度为 <span class="arithmatex">\(h\)</span> 时的节点总数</td>
+<td>高度 <span class="arithmatex">\(h\)</span> 树的节点总数</td>
 <td><span class="arithmatex">\(2^{h+1} - 1\)</span></td>
 <td><span class="arithmatex">\(h + 1\)</span></td>
 </tr>
 <tr>
-<td>树的节点总数为 <span class="arithmatex">\(n\)</span> 时的高度</td>
+<td>节点总数 <span class="arithmatex">\(n\)</span> 树的高度</td>
 <td><span class="arithmatex">\(\log_2 (n+1) - 1\)</span></td>
 <td><span class="arithmatex">\(n - 1\)</span></td>
 </tr>