data-structures-linked-lists

Question 1

How are linked lists different from an array?

Answer 1

Linked lists are sequential access (like a queue) and arrays are random access. This means that, in order to go a specific place in the list, you have to start at the beginning, then jump from node to node until you get there.

Question 2

How would you access an arbitrary node in a linked list (not just the “head”)?

Answer 2

Using the .next property and chaining them.