linux c hashmap

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

typedef struct Node {
    char *key;
    int value;
    struct Node *next;
} Node;

typedef struct HashTable {
    int size;
    Node **table;
} HashTable;

unsigned int hash(const char *key, int size) {
    unsigned int hash = 0;
    while (*key) {
        hash = (hash << 5) + *key++;
    }
    return hash % size;
}

HashTable* createHashTable(int size) {
    HashTable *ht = malloc(sizeof(HashTable));
    ht->size = size;
    ht->table = calloc(size, sizeof(Node *));
    return ht;
}

void insert(HashTable *ht, const char *key, int value) {
    unsigned int index = hash(key, ht->size);
    Node *newNode = malloc(sizeof(Node));
    newNode->key = strdup(key);
    newNode->value = value;
    newNode->next = ht->table[index];
    ht->table[index] = newNode;
}

int search(HashTable *ht, const char *key) {
    unsigned int index = hash(key, ht->size);
    for (Node *node = ht->table[index]; node; node = node->next) {
        if (strcmp(node->key, key) == 0) {
            return node->value;
        }
    }
    return -1; // Not found
}

void freeHashTable(HashTable *ht) {
    for (int i = 0; i < ht->size; ++i) {
        Node *node = ht->table[i];
        while (node) {
            Node *temp = node;
            node = node->next;
            free(temp->key);
            free(temp);
        }
    }
    free(ht->table);
    free(ht);
}

int main() {
    HashTable *ht = createHashTable(10);
    insert(ht, "apple", 1);
    insert(ht, "banana", 2);
    printf("Value of 'apple': %d\n", search(ht, "apple"));
    printf("Value of 'banana': %d\n", search(ht, "banana"));
    freeHashTable(ht);
    return 0;
}