The combination of dynamic allocation and linked data structures is
extremely attractive because it utilizes memory with very high
efficiency.

<H2>However</H2>

<UL>
  <LI>The programmer is responsible for freeing memory, as soon as
      possible, but no sooner.<P>
  <LI>Extra memory space is required to store links. This overhead is
      usually small compared to the increased utilization of memory,
      but be wary.<P>
  <LI>The code for manipulating linked structures may be more complex
      than for contiguous structures:
      <UL>
        <LI>This complexity should be invisible to the <EM>user</EM>
            of an abstract data type.<P>
        <LI>It is the <EM>implementer's</EM> problem and should be
            limited to <EM>core</EM> operations.
      </UL>
</UL>