Linked Lists WedW15

Linked Lists WedW15

1. Composed of nodes

   • Nodes contain data
   • Nodes contain pointer to nxt node
   • typedef struct node{ int data; struct node * next;}NODE;
   • Saved in the heap
     • NODE* p = malloc(sizeof(NODE));
     • free(p);
     • assert(p!=NULL);

2. add nodes

   • add to front
     • newNode->next= head; head = newNode;
   • add to back
   • add to middle

3. delete nodes

   • delete front
   • delete middle
   • delete last
   • delete all

4. traverse a list

   • modify/set values
   • append (see add node)
   • counting nodes (length)
   • search for value
   • sum, average, math
   • # of occurances

5. Always starts with head

   • head == NULL the list is empty
   • head != NULL list is occupied

6. Always end with NULL

   • if(p->next == NULL) p is point to the last node (p is tail)
     • found the end of the list (see append)
   • if(p == NULL)
     • traverse through whole list