Linked Lists WedW15

Composed of nodes
1. Nodes contain data
2. Nodes contain pointer to nxt node
3. typedef struct node{ int data; struct node * next;}NODE;
4. Saved in the heap
  1. NODE* p = malloc(sizeof(NODE));
  2. free(p);
  3. assert(p!=NULL);
add nodes
1. add to front
  1. newNode->next= head; head = newNode;
2. add to back
3. add to middle
delete nodes
1. delete front
2. delete middle
3. delete last
4. delete all
traverse a list
1. modify/set values
2. append (see add node)
3. counting nodes (length)
4. search for value
5. sum, average, math
6. # of occurances
Always starts with head
1. head == NULL the list is empty
2. head != NULL list is occupied
Always end with NULL
1. if(p->next == NULL) p is point to the last node (p is tail)
  1. found the end of the list (see append)
2. if(p == NULL)
  1. traverse through whole list

Resource summary

	Created by Madeline Harlow almost 10 years ago

	Copied by Neyavanan v over 5 years ago