1. Add the building util of Python

for the markdown docs.
2. Update the deploy.sh

codes/python/chapter_hashing/array_hash_map.py

@@ -6,7 +6,7 @@ Author: msk397 (machangxinq@gmail.com)
 
 """ 键值对 int->String """
 class Entry:
-    def __init__(self, key: int, val: str):
+    def __init__(self, key, val):
         self.key = key
         self.val = val
 

codes/python/chapter_tree/binary_search_tree.py

@@ -54,11 +54,9 @@ class BinarySearchTree:
         # 若树为空，直接提前返回
         if root is None:
             return None
-
-        cur = root
-        pre = None
-
+        
         # 循环查找，越过叶结点后跳出
+        cur, pre = root, None
         while cur is not None:
             # 找到重复结点，直接返回
             if cur.val == num:
@@ -86,10 +84,8 @@ class BinarySearchTree:
         if root is None:
             return None
 
-        cur = root
-        pre = None
-
         # 循环查找，越过叶结点后跳出
+        cur, pre = root, None
         while cur is not None:
             # 找到待删除结点，跳出循环
             if cur.val == num:
@@ -99,7 +95,6 @@ class BinarySearchTree:
                 cur = cur.right
             else:  # 待删除结点在 cur 的左子树中
                 cur = cur.left
-
         # 若无待删除结点，则直接返回
         if cur is None:
             return None