整理解题技巧及数据结构知识

diguage · diguage · commit 5aee0fab303c · 2024-06-23T22:59:39.000+08:00
diff --git a/docs/0000-00-note.adoc b/docs/0000-00-note.adoc
@@ -8,3 +8,5 @@
 . 树形 DP 套路
 . 前缀和
 .. xref:0523-continuous-subarray-sum.adoc[523. Continuous Subarray Sum]
+. 树的 Morris 遍历
+.. TODO: 基于 Morris 遍历的中序排列已经掌握，前序，尤其是后续还需要加强。
diff --git a/docs/0000-22-union-find-set.adoc b/docs/0000-22-union-find-set.adoc
@@ -0,0 +1,7 @@
+[#union-find-set]
+= Union Find Set 查并集
+
+
+== 参考资料
+
+. https://leetcode.cn/problems/redundant-connection/solutions/372045/yi-wen-zhang-wo-bing-cha-ji-suan-fa-by-a-fei-8/[684. 冗余连接 - 一文掌握并查集算法^]
diff --git a/docs/0000-data-structure-tree.adoc b/docs/0000-data-structure-tree.adoc
@@ -0,0 +1,18 @@
+[#data-structure-tree]
+= 数据结构：树
+
+
+== Morris 遍历
+
+二叉搜索树相关的的一些题目，很可能就会利用中序遍历是升序序列的特性来处理一下问题。那么，在时间复杂度相同，但空间复杂度都特别优秀的 Morris 遍历就是一个很好的选择。
+
+image::images/0000-ds-tree-01.jpg[]
+
+. xref:0098-validate-binary-search-tree.adoc[98. Validate Binary Search Tree]
+. xref:0099-recover-binary-search-tree.adoc[99. Recover Binary Search Tree]
+
+TODO: 加强基于 Morris 遍历的前序和后序遍历练习。
+
+== 参考资料
+
+. https://leetcode.cn/problems/recover-binary-search-tree/solutions/365873/yi-wen-zhang-wo-morrisbian-li-suan-fa-by-a-fei-8/[99. 恢复二叉搜索树 - 一文掌握Morris遍历算法^]
diff --git a/docs/images/0000-ds-tree-01.jpg b/docs/images/0000-ds-tree-01.jpg
diff --git a/docs/index.adoc b/docs/index.adoc
@@ -8,6 +8,8 @@ D瓜哥 <https://www.diguage.com/>
 
 include::0000-00-overview.adoc[leveloffset=+1]
 
+include::0000-data-structure-tree.adoc[leveloffset=+1]
+
 include::0000-01-sliding-window.adoc[leveloffset=+1]
 
 include::0000-02-two-pointer.adoc[leveloffset=+1]
@@ -50,6 +52,8 @@ include::0000-20-transform-and-conquer.adoc[leveloffset=+1]
 
 include::0000-21-dynamic-programming.adoc[leveloffset=+1]
 
+include::0000-22-union-find-set.adoc[leveloffset=+1]
+
 // :sectnums:
 
 include::0001-two-sum.adoc[leveloffset=+1]
