[3] add hash table

pomelovsd/DataStruct/BinaryTree.py

@@ -0,0 +1,3 @@
+def create_node(name,phone):
+    return {"name": name, "phone": phone, "left": None, "right": None}
+

pomelovsd/DataStruct/HashTable.py

@@ -0,0 +1,30 @@
+from LinkedList import ll_insert, ll_find, ll_delete, ll_list_all
+
+def ht_create(size = 1000):
+    return[None] * size
+
+def hash_function(name, size = 1000): 
+    value = 0
+    for char in name:
+        value = (value * 31 + ord(char)) % size
+    return value
+
+def ht_insert(buckets, name, phone):
+    index = hash_function(name, len(buckets))
+    buckets[index] = ll_insert(buckets[index], name, phone)
+    return buckets
+
+def ht_delete(buckets, name): 
+    index = hash_function(name, len(buckets))
+    buckets[index] = ll_delete(buckets[index], name)
+    return buckets
+
+def ht_find(buckets, name):
+    index = hash_function(name, len(buckets))
+    return ll_find(buckets[index], name)
+
+def ht_list_all(buckets):
+    records = []
+    for bucket in buckets:
+        if buckets is not None:
+            records.extend(ll_list_all(buckets))

pomelovsd/DataStruct/data_structures.ipynb

@@ -15,7 +15,7 @@
     }
    ],
    "source": [
-    "import LinkedLists\n",
+    "import LinkedList\n",
     "import HashTable\n"
    ]
   }

pomelovsd/HashTable.py

@@ -1,3 +0,0 @@
-def 
-
-def ht_insert(buckets, name, phone):