Lesson 3.3: More Linked Lists

Class Meeting:

Section	Slides	Annotated Slides	Video
12–1PM	3.3-linkedlist2-203-1221.p Download 3.3-linkedlist2-203-1221.pdf	PDF Download PDF	See Zoom Cloud Recordings
1–2PM	3.3-more-linked-lists-1pm.pdf Download 3.3-more-linked-lists-1pm.pdf	3.3-more-linked-lists-1pm-annotated.pdf Download 3.3-more-linked-lists-1pm-annotated.pdf	See Zoom Cloud Recordings
4–5PM	3.3-more-linked-lists-4pm.pdf Download 3.3-more-linked-lists-4pm.pdf	3.3-more-linked-lists-4pm-annotated.pdf Download 3.3-more-linked-lists-4pm-annotated.pdf	See Zoom Cloud Recordings

---

Readings:

• Carrano & Henry: Chapter 4 
• Carrano & Henry: Chapter 1.1-1.4

---

Summary:

In this lesson we solve  algorithmic problems on Singly Linked Lists.

 

---

Learning Outcomes:

• Use singly linked lists as the underlying structure for implementing two complex functions: reverse, and printReverseOdds.