How to implement an associative data structure of an array / map / hash table (in general and in C ++)

Question

Well, I’m making a small phonebook application, and I decided that using maps would be a better data structure, but I don’t know where to start. (Gotta implement a data structure from scratch - school work)

Answer 1

Tries are pretty effective for implementing maps where keys are short strings. The Wikipedia article explains this pretty well.

To deal with duplicates, just make each node of the tree a repository of a linked list of duplicate matches

Here is the basic structure for trie

struct Trie {
   struct Trie* letter;
   struct List *matches;
};

malloc (26 * sizeof (struct Trie)) , . , .

, , , struct List .

Answer 2

, - . , . , . , .

Answer 3

: , .

( / ), -. : , , - -, . , , ( , : -)).

, , ( ): , , .

, , : -)