Author: brendanbondurant

These are the last two methods I’ll probably write about in this linked list series. You know the drill by now, so here are the tests (I’m giving you all of them at once, apologies for the big code block) Alright, so there are quite a few edge cases for find, so we will start…

Implementing pop and shift for a linked list, and testing both against empty and single-element lists.

Writing an insert method for a linked list, with a prepend option and error handling for invalid positions.

Writing a node_at method to find and return a specific node in a linked list, using a counter to walk the chain.

Adding a prepend method to a linked list so items can be added at the start, not just the end.

Writing a stringify method that turns a linked list’s nodes into a readable string, including the empty-list case.