11-15 Class Notes CS 107

11-15 Class Notes CS 107 - These two issues are addressed...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Announcements: Remember the program is due tomorrow. Questions? Last Time: Linked list intuition Today: Code to implement a linked list; Recursively reversing a linked list 11-15 Class Notes CS 107 Monday, November 15, 2010 2:15 PM 107 Fall 2010 Page 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
107 Fall 2010 Page 2
Background image of page 2
Issues we saw were: 1. How to find where to insert the new node, and 2. What happens when we run out of space.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: These two issues are addressed in the sample code shown below: 107 Fall 2010 Page 3 Do a trace of this code to ensure you understand what it is doing. Now that we see how to insert into a linked list, consider the (tricky) code that we can use to recursively reverse a linked list, shown in a separate document under today's notes. 107 Fall 2010 Page 4...
View Full Document

Page1 / 4

11-15 Class Notes CS 107 - These two issues are addressed...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online