Lecture 13: Coding with Linked List

author: Julie Zelenski, Computer Science Department, Stanford University
published: Nov. 15, 2010,   recorded: January 2008,   views: 4863
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)
Categories

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Delicious Bibliography

Description

the name and the address of someone and then attaching it to the front part of the list. So we talked about why that was the easiest thing to do and I’m gonna just re-draw this picture again because we’re gonna need it as we go through and do stuff. Here’s the main stack frame. It’s got this pointer list, which is expected to point to an entry out in the heap. It starts pointing at null. We have this local variable down here, new one that is also a pointer to an entry and based on the result from get new entry, which will either return null to say there’s no more entries or a new heap allocated thing if it gives us this new entry that says here’s Jason and his phone number. ...

See the whole transcript at Programming Abstractions- Lecture 13

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: