jdk7u-jdk

not from the textbook, but other's successful implementations, at a time when it actually matters. Here's how I'd improve it: find implementations of linked lists, queues, stacks, graphs, and whatever in programming languages, their standard libraries, and community frameworks. Show people the utility, have them conceptualize it internally, rather than memorize it. Here are some off the top of my head: Something broad and standardized, templated containers of data structures, like C++'s stdlib and its vector, map, and so on. Last time I checked chromium's source tree, std:: was everywhere: https://cs.chromium.org/search/?q=std::+package:chromium&sq=... Something low-level and cool, like Python's timsort: https://svn.python.org/projects/python/trunk/Objects/listsor.... (Java actually ended up borrowing that: https://github.com/openjdk-mirror/jdk7u-jdk/blob/master/src/...) Something high-level, for instance, django-treebeard's approaches toward handling hierarchies in Django. In this package, adjacency lists (https://en.wikipedia.org/wiki/Adjacency_list) are carried over not just to relational databases, but an ORM system. (https://django-treebeard.readthedocs.io)

== key \ || (key != null \ && key.equals(k)))) return e; } return null; } TL;DR how did they imagine a general setContains would be implemented without a loop? [ed: obviously it makes sense to use a datastructure that more closely match your intent, but the wording here struck me as a bit odd...]