a

Author: Alan Tseng

docs/DSA/Linked_List/0.linked_list.md

@@ -171,20 +171,21 @@ void delete_node(Node* node, int n)
 刪除中間節點，我們可以使用 fast-slow pointer 的方法來找到中間節點。
 ![alt text](assets/image-4.png)
 ```c
-void delete_mid(Node* node)
+void delete_mid(Node* head)
 {
+    if (!head || !head->next || !head->next->next) return;
     puts("delete mid");
-    Node* slow = node->next; // 跳過 dummy head
-    Node* fast = node->next; // 跳過 dummy head
-    Node* pre = node;
-    while (fast != NULL && fast->next != NULL)
+    Node* slow = head->next; // 跳過 dummy head
+    Node* fast = head->next; // 跳過 dummy head
+    Node* pre = head;
+    while (fast && fast->next)
     {
         pre = slow;
         slow = slow->next;
         fast = fast->next->next;
     }
     // 如果 slow 為 NULL，表示鏈表長度為 1 或 0，無需刪除
-    if (slow!= NULL) {
+    if (slow) {
         pre->next = slow->next;
         free(slow);
     }   

docs/DSA/Tree/binary_tree.md

@@ -0,0 +1,2 @@
+
+reverse 

docs/assets/image-1.png

@@ -0,0 +1,2 @@
+
+- [國立清華大學科技管理學院-孫運璿科技講座演講](https://sunspeech.site.nthu.edu.tw/)

docs/grow.md

@@ -0,0 +1,2 @@
+# health
+![alt text](assets/image-1.png)