Question

Briefly explain the method you will use to execute an array linked list?

Answer 1

Accessing elements with Array List are much faster as it is index based.

But with Linked List it is tough because the process is slow.

Insertion and deletion is quite faster with Linked List, because the node changes the pointers prior to or post the nodes.

With Array List insertion or deletion is slower because these operations adjust the indexes in terms of the deletion or insertion.