bg287

csc210 Notes

Posted in csc210 by bnmng on 2011 02/16

Homework: Read Chapter 5 to page 279.
Linked list utilities; traversal; head insert; l

Handout.
Next program assigned Monday due Wed after spring break. Test likely Monday after spring break.
Next program will be a simple link list with overload input and outputs and some kind of sort.

Need a destructor for linked lists.

Null is in cstd library.

!Understand. If a pointer is passed with a ‘const’ keyword, the pointer can still be changed! What it points to cannot be changed.

Insert: allocate data, store the data; point new node into list; point list at new node;

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: