Implementation of hash map
Some obvious problems


It leaks memory (every newly allocated Node) when the Hashmap leaves the scope.
A delete/remove function is missing.
It doesn't replace the value within the existing Node on repeated puts with the same key but instead adds an additional Node every time.
The size is fixed and therefore the hashmap get quickly degenerates into linked list search.
Key and value types aren't generic.


Some positive things


It implements a hashmap 
uses hash-lookup for search 
returns correct results