Author: Unknown
Subject: Fixed-length array of children for trie
Date: Wednesday, 22 Apr 2020, 09:29:33

Will using a fixed-length array (with size = # of letters) to store children in our trie struct be quicker than using a dynamic array because you don't have to rely on search for the former option? If so, is the main drawback of using a fixed-length array a higher storage cost?