What is the trade-offs in time complexity between an arraylist and a linkedlist?

  In the time complexity, the array-list can easily be accessible any type of element in the the given list in the fixed amount of time.

On the other hand, the linked list basically require that the list must be traversed from one position to another end position.

The Array-List can get to any component of the rundown in a similar measure of time if the file value is know, while the Linked-List requires the rundown to be crossed from one end or the other to arrive at a position.