 It can also be slow, and with a naïve allocator, wasteful, to allocate memory separately for each new element, a problem generally solved using memory pools.Some hybrid solutions try to combine the advantages of the two representations.Unrolled linked lists store several elements in each list node, increasing cache performance while decreasing memory overhead for references.