Adventures in Linked Lists

Sharing a quick presentation on a neat trick when dealing with linked lists.

In the talk, we go over the CS 101 version of removing an element from a singly linked list. We then show you how to look at the problem in another way such that some of the edge cases can become unnecessary!

alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text alt text