 On the other hand, dynamic arrays (as well as fixed-size array data structures) allow constant-time random access, while linked lists allow only sequential access to elements.Singly linked lists, in fact, can be easily traversed in only one direction.This makes linked lists unsuitable for applications where it's useful to look up an element by its index quickly, such as heapsort.