Below are the advantages of Dynamic representation of Lists over its Array implementation –

  • No advanced knowledge of number of nodes is required
  • No memory space is wasted by bulk allocation as in the case of a large array since memory space is allocated only when a node is created
  • A reference to a pointer P doesn’t involve the address calculations as it requires so in the case of array implementation
  • It is easy to insert or delete items since no shifting is needed

Leave a Reply

Your email address will not be published. Required fields are marked *