auto commit

docs/notes/代码可读性.md

@@ -31,7 +31,7 @@
 
 |  单词 |  可替代单词 |
 | :---: | --- |
-|  send | deliver、dispatch、announce、distribute、route  |
+| send | deliver、dispatch、announce、distribute、route  |
 | find  |  search、extract、locate、recover |
 | start| launch、create、begin、open|
 | make | create、set up、build、generate、compose、add、new |

docs/notes/剑指 offer 题解.md

@@ -2998,7 +2998,7 @@ public int StrToInt(String str) {
 
 ### 二叉查找树
 
-<div align="center"> <img src="pics/293d2af9-de1d-403e-bed0-85d029383528.png" width="300"/> </div><br>
+<div align="center"> <img src="pics/b39a085e-e7a2-4657-b75e-ba1652a4b132.jpg" width="300"/> </div><br>
 
 [Leetcode : 235. Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/description/)