Lecture Objectives

Lecture 16 Objectives

At the end of today's class you should

KNOW:

The difference between a linked list and a sequential list

BE ABLE TO:

Write code to build a linked list
Write code to traverse a linked list

Sample Exam Question:

Implement the following function:

    int everyNodeIsx (struct listNode* head, int x);
    /* Precondition: head is the head pointer of a 
    ** non-empty linked list.
    ** Postcondition: The return value is 1 (true) if every node in the
    ** list contains x in the data part. Otherwise, the return value
    ** is 0 (false).
    */