I tried to test perfomance of different approaches to build and use trie data structure.
I used 706D - Vasiliy's Multiset to test my versions of tries on it.
The question is: Why does approach with pointers takes 2 times more memory than one with static array? As I know, a pointer stores an address of a variable, so it shouldn't take that much memory.
Here are my submissions:
Pointer approach: 40063381
Static array approach: 40063561
Any suggestions are welcomed!