 On the other hand, since simple linked lists by themselves do not allow random access to the data or any form of efficient indexing, many basic operations—such as obtaining the last node of the list, finding a node that contains a given datum, or locating the place where a new node should be inserted—may require iterating through most or all of the list elements.The advantages and disadvantages of using linked lists are given below.Linked list are dynamic, so the length of list can increase or decrease as necessary.