I like these. You can embody the "link" nature, but the physical analogies also gain operations that make them not match linked list[1], such as:
• The examples all seem to include back links as well.
• Most of them you can access an interior element in constant time.
• Most of them you can get a size estimate without traversing.
• The dishes are more stack like. Traversal is destructive, but it doesn't add operations. (I think)
• The deli numbers give you a constant time "distance between" operator (unless the deli has lost a lot of the tags), and require a global method dispatch to find "next". 37? 37?… 38?
[1] Somewhere in the '80s, Dr. Roman[2] was explaining binary search to a class of 'us' and started to use a phone book analogy, until he realized that people have more information than just alphabetic letter position to work with, they have an idea about frequency in names as well. That's stuck with me as a caution of the difficulty of analogy.
[2] Oh look, he is department chair now. Well done! (Warning to students: if you are having trouble in CSE425S (formerly CS 455) with the programming-language-of-the-week being prolog, and you figure out how to build yourself variables, he will see through you and give you a bad grade, my poor little grid bugs.)