I am confused because both of these contain an index, so a indexed linked list has nodes and indexes? While array list only has indexes?
ArrayList is continuous representation of the data .
So if base addr is lets say 64 and you want a element at 4th index and size of each element is 4 bytes so by doing the math we can say at what memory addr to look for 4th index element . So we can land at up at the element directly
On the other hand Linked List we have to traverse node by node and by counting the numbers of node traversed .
SO index works for both of them.For arraylist we can access it directly but in Linked list we have to traverse the intermediate nodes