diff --git a/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree/README.md b/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree/README.md
index 0c0c91aef..692a49ca3 100644
--- a/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree/README.md
+++ b/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree/README.md
@@ -27,4 +27,5 @@ One possible answer is: [0,-3,9,-10,null,5], which represents the following heig
 
 ## 解题思路
 
-思路比较简单，依次把链表的中间点作为根结点，类似二分的思想，递归排列所有结点即可。
\ No newline at end of file
+思路比较简单，依次把链表的中间点作为根结点，类似二分的思想，递归排列所有结点即可。
+