What differentiates an ArrayList from a LinkedList in terms of internal structure?

• A. ArrayList uses a stack, while LinkedList uses a queue
• B. ArrayList uses a dynamic array, while LinkedList uses a doubly linked list
• C. ArrayList has faster manipulation, while LinkedList has slower access
• D. ArrayList stores elements in a sorted manner, while LinkedList does not

Answer: (B)

The key distinction lies in the internal structure that each collection utilizes to store data. An ArrayList employs a dynamic array, which means it allocates a contiguous block of memory to hold its elements. This allows for quick access to elements via their indices since the position of each element is predictable. However, when the ArrayList exceeds its initial capacity, it must create a new, larger array and copy over the elements, which can be time-consuming.

In contrast, a LinkedList is structured as a series of nodes, where each node contains data and pointers connecting it to the previous and next nodes in the sequence. This doubly linked structure allows for efficient insertions and deletions at any point in the list without requiring the reallocation of memory, as each node can exist independently.

Understanding this fundamental difference helps clarify why one might choose one data structure over the other depending on the specific needs of the application, such as whether frequent insertions/removals or direct access is more critical.