✨ Add Comments

2023-05-21 21:49:33 +08:00 · 2020-08-17 23:08:52 +08:00
parent 8a1506aac8
commit bd3dc89610
60 changed files with 184 additions and 38 deletions
--- a/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_0_树.md
+++ b/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_0_树.md
@@ -27,4 +27,5 @@
 总结：

 ![image-20200805135536601](https://cdn.jsdelivr.net/gh/KimYangOfCat/MyPicStorage/2021-CSPostgraduate-408/007S8ZIlly1ghfw6z51b3j31f30u0b29.jpg)
-
+<!-- 评论模块，不可删除 -->
+<Vssue  />
--- a/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_10_树的存储结构.md
+++ b/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_10_树的存储结构.md
@@ -1,3 +1,4 @@
 # 数的存储结构

-
+<!-- 评论模块，不可删除 -->
+<Vssue  />
--- a/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_11_数和森林的遍历.md
+++ b/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_11_数和森林的遍历.md
@@ -1,3 +1,4 @@
 # 数和森林的遍历

-
+<!-- 评论模块，不可删除 -->
+<Vssue  />
--- a/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_12_二叉排序树.md
+++ b/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_12_二叉排序树.md
@@ -1,2 +1,4 @@
 # 二叉排序树

+<!-- 评论模块，不可删除 -->
+<Vssue  />
--- a/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_13_平衡二叉树.md
+++ b/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_13_平衡二叉树.md
@@ -1,3 +1,5 @@
 # 平衡二叉树

+<!-- 评论模块，不可删除 -->
+<Vssue  />

--- a/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_14_哈夫曼树.md
+++ b/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_14_哈夫曼树.md
@@ -1 +1,4 @@
 # 哈夫曼树
+
+<!-- 评论模块，不可删除 -->
+<Vssue  />
--- a/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_1_树的性质.md
+++ b/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_1_树的性质.md
@@ -12,4 +12,6 @@

 ![image-20200805182505953](https://cdn.jsdelivr.net/gh/KimYangOfCat/MyPicStorage/2021-CSPostgraduate-408/20200810013225.jpg)

-![image-20200805182524995](https://cdn.jsdelivr.net/gh/KimYangOfCat/MyPicStorage/2021-CSPostgraduate-408/20200810013230.jpg)
+![image-20200805182524995](https://cdn.jsdelivr.net/gh/KimYangOfCat/MyPicStorage/2021-CSPostgraduate-408/20200810013230.jpg)
+<!-- 评论模块，不可删除 -->
+<Vssue  />
--- a/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_2_二叉树.md
+++ b/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_2_二叉树.md
@@ -16,4 +16,6 @@

 总结：

-![image-20200805183503356](https://tva1.sinaimg.cn/large/007S8ZIlly1ghg49qdqdxj320l0u07wh.jpg)
+![image-20200805183503356](https://tva1.sinaimg.cn/large/007S8ZIlly1ghg49qdqdxj320l0u07wh.jpg)
+<!-- 评论模块，不可删除 -->
+<Vssue  />
--- a/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_3_二叉树的性质.md
+++ b/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_3_二叉树的性质.md
@@ -14,4 +14,6 @@

 ![image-20200805184122555](https://cdn.jsdelivr.net/gh/KimYangOfCat/MyPicStorage/2021-CSPostgraduate-408/20200810013400.jpg)

-![image-20200805184243281](https://tva1.sinaimg.cn/large/007S8ZIlly1ghg4hpehe1j31ow0u0qv5.jpg)
+![image-20200805184243281](https://tva1.sinaimg.cn/large/007S8ZIlly1ghg4hpehe1j31ow0u0qv5.jpg)
+<!-- 评论模块，不可删除 -->
+<Vssue  />
--- a/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_4_二叉树的存储结构.md
+++ b/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_4_二叉树的存储结构.md
@@ -27,4 +27,7 @@
 总结回顾：
 ![image-20200805185538146](https://cdn.jsdelivr.net/gh/KimYangOfCat/MyPicStorage/2021-CSPostgraduate-408/20200810013555.jpg)

-![image-20200805185553685](https://cdn.jsdelivr.net/gh/KimYangOfCat/MyPicStorage/2021-CSPostgraduate-408/20200810013603.jpg)
+![image-20200805185553685](https://cdn.jsdelivr.net/gh/KimYangOfCat/MyPicStorage/2021-CSPostgraduate-408/20200810013603.jpg)
+
+<!-- 评论模块，不可删除 -->
+<Vssue  />
--- a/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_5_二叉树的遍历.md
+++ b/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_5_二叉树的遍历.md
@@ -36,4 +36,6 @@

 ### 代码实现

-![image-20200805191445914](https://tva1.sinaimg.cn/large/007S8ZIlly1ghg5f1pfwcj31ju0u04qq.jpg)
+![image-20200805191445914](https://tva1.sinaimg.cn/large/007S8ZIlly1ghg5f1pfwcj31ju0u04qq.jpg)
+<!-- 评论模块，不可删除 -->
+<Vssue  />
--- a/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_6_二叉树的构造.md
+++ b/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_6_二叉树的构造.md
@@ -31,4 +31,5 @@
 若前序、后序、层序序列两两组合，是否能确定唯一的一颗二叉树？

 答案是：不能，必须有中序序列划分左右子树🌲
-
+<!-- 评论模块，不可删除 -->
+<Vssue  />
--- a/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_7_线索二叉树.md
+++ b/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_7_线索二叉树.md
@@ -41,4 +41,5 @@
 ## 总结回顾

 ![image-20200810134838622](https://cdn.jsdelivr.net/gh/KimYangOfCat/MyPicStorage/2021-CSPostgraduate-408/20200810134838.png)
-
+<!-- 评论模块，不可删除 -->
+<Vssue  />
--- a/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_8_二叉树的线索化.md
+++ b/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_8_二叉树的线索化.md
@@ -8,4 +8,8 @@

 ## 中序线索化

-![image-20200810135151257](https://cdn.jsdelivr.net/gh/KimYangOfCat/MyPicStorage/2021-CSPostgraduate-408/20200810135151.png)
+![image-20200810135151257](https://cdn.jsdelivr.net/gh/KimYangOfCat/MyPicStorage/2021-CSPostgraduate-408/20200810135151.png)
+
+
+<!-- 评论模块，不可删除 -->
+<Vssue  />
--- a/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_9_线索二叉树的前驱和后继.md
+++ b/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_9_线索二叉树的前驱和后继.md
@@ -1,3 +1,4 @@
 # 找线索二叉树结点的前驱和后继

-
+<!-- 评论模块，不可删除 -->
+<Vssue  />
--- a/408Notes/DataStructure/DS_4_TreeAndBinaryTree/README.md
+++ b/408Notes/DataStructure/DS_4_TreeAndBinaryTree/README.md
@@ -12,3 +12,6 @@
 * [二叉树的构造](Doc_4_6_二叉树的构造.md)
 * [线索二叉树](Doc_4_7_线索二叉树.md)
 * [二叉树的线索化](Doc_4_8_二叉树的线索化.md)
+
+<!-- 评论模块，不可删除 -->
+<Vssue  />