Update README.md

Author: rcmgleite

README.md

@@ -1,7 +1,9 @@
 # key-value-db
-This project is a simple implementation of a hash-map.
+This project contains different implementations of hash maps
 <br>
-The underlaying data structure of this implementation is a Binary Search Tree.
+Currently developed:
+  1.  Using a Binary Search Tree as underlying data structure
+  2.  Using a Dynamic resizing array as underlying data structure
 
 ## Dependencies:
   This project depends on:

src/source/hash_table.c

@@ -85,7 +85,7 @@ int hash_table_insert_elem(hash_table_t** t, const char* key, const char* value)
 		return 0;
 
 	if(((*t)->size + 1) % (*t)->capacity == 0) {
-		hash_table_rehash(&(*t));
+		hash_table_rehash(t);
 	}
 
 	uint32_t hashed_key = (*t)->hash_function((*t), key, strlen(key));