data-structures-linked-lists

Question 1

How are linked lists different from an array?

Answer 1

Linked lists are sequential access (like a queue), not random access (like an array). However, unlike a queue, a linked list doesn’t need to be mutated to scan its contents.

Question 2

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

Answer 2

You to apply the next property to the head node repeatedly until you get to the arbitrary point