Fix broken links

02-hash-table/README.md

@@ -46,7 +46,7 @@ static ht_item* ht_new_item(const char* k, const char* v) {
 
 `ht_new` initialises a new hash table. `size` defines how many items we can
 store. This is fixed at 53 for now. We'll expand this in the section on
-[resizing](/resizing). We initialise the array of items with `calloc`, which
+[resizing](/06-resizing). We initialise the array of items with `calloc`, which
 fills the allocated memory with `NULL` bytes. A `NULL` entry in the array
 indicates that the bucket is empty.
 

05-methods/README.md

@@ -14,7 +14,7 @@ void ht_delete(ht_hash_table* h, const char* key);
 To insert a new key-value pair, we iterate through indexes until we find an
 empty bucket. We then insert the item into that bucket and increment the hash
 table's `count` attribute, to indicate a new item has been added. A hash table's
-`count` attribute will become useful when we look at [resizing](/resizing) in
+`count` attribute will become useful when we look at [resizing](/06-resizing) in
 the next section.
 
 ```c