Linked Lists & Stacks and Queues 1
Snarf the code for today’s class. In it you’ll find
2 solutions for Question 3 from the exam.
Make sure you recall how that question worked
(you can look it up in the old exam section of
the course website)
What We’ll Do Today
1. Go over the Big O for linked lists
2. Begin a discussion of isAncestor, a more
complex variation on isFemale ancestor that
illustrates a key point
3. Hand back your exams
Note that a new version of TestStrand has been
posted on Piazza