An elegant solution to this problem of datamovement in sequential representations isachieved by using linked representations. Unlikea sequential representation, in which successiveitems of a list are located a fixed distanceapart, in a linked representation theseitems may be placed anywhere in memory.In other words, in a sequential representationthe order of elements is the same sas in theordered list, whereas in a linked representationthese two sequences need not be the same