From 0b2ae012d04a56ac2c7a82314f107944d87901da Mon Sep 17 00:00:00 2001
From: ranwenjie <ranwenjie@didichuxing.com>
Date: Wed, 10 Nov 2021 16:27:32 +0800
Subject: [PATCH] update recursion

---
 8 Algorithms Analysis/递归.md          | 38 +++++++++++++++++++++++++-
 9 Algorithms Job Interview/7 二叉树.md | 15 ++++++++++
 2 files changed, 52 insertions(+), 1 deletion(-)

diff --git a/8 Algorithms Analysis/递归.md b/8 Algorithms Analysis/递归.md
index 112256d..94f9d3f 100644
--- a/8 Algorithms Analysis/递归.md	
+++ b/8 Algorithms Analysis/递归.md	
@@ -17,14 +17,50 @@
 
 ### 递归公式
 
-快排
+[快排](../6%20Sort/README.md)
+
+```Java
+    void quicksort(int *a, int left, int right){
+        if (left<right)//加上这个，不然有死循环，造成堆栈溢出，这也是递归结束条件
+        {
+            int i = partion(a,left,right);//使得局部有序，i作为分隔
+            quicksort(a,left,i-1); 
+            quicksort(a,i+1,right);
+        }
+    }
+
+```
 
 归并排
 
+```Java
+void sort(int[] nums, int lo, int hi) {
+    int mid = (lo + hi) / 2;
+    sort(nums, lo, mid);
+    sort(nums, mid + 1, hi);
+
+    /****** 后序遍历位置 ******/
+    // 合并两个排好序的子数组
+    merge(nums, lo, mid, hi);
+    /************************/
+}
+
+```
+
 
 二叉树
 
+```Java
+/* 二叉树遍历框架 */
+void traverse(TreeNode root) {
+    // 前序遍历
+    traverse(root.left)
+    // 中序遍历
+    traverse(root.right)
+    // 后序遍历
+}
 
+```
 
 
 
diff --git a/9 Algorithms Job Interview/7 二叉树.md b/9 Algorithms Job Interview/7 二叉树.md
index 2725751..1bc6d32 100644
--- a/9 Algorithms Job Interview/7 二叉树.md	
+++ b/9 Algorithms Job Interview/7 二叉树.md	
@@ -20,6 +20,21 @@ struct SBinaryTreeNode // a node of the binary tree
 };
 ```
 
+二叉树递归框架
+
+```Java
+
+/* 二叉树遍历框架 */
+void traverse(TreeNode root) {
+    // 前序遍历
+    traverse(root.left)
+    // 中序遍历
+    traverse(root.right)
+    // 后序遍历
+}
+
+```
+
 
 
 ## 二叉树翻转