Linked Lists

Linked Lists

Variable size
1. Change in real time (on run time)
composed of nodes
1. structs
  1. contains the data types you want
  2. one element is a pointer to the next node
Saved in the heap
1. dynamic memory
  1. malloc
    1. each node individually
    2. Assert
    3. sizeof
  2. free
    1. Each node individually (loop)
ALWAYS started by the head pointer
1. The first thing you ALWAYS do is declare and initialize the head pointer,
Singly linked
1. list pointing in one direction
  1. once you go to the next node, you can't get back, UNLESS you keep track of the previous node
    1. have a 'previous' pointer
End of the list is represented by NULL
1. Always begin by initializing the next pointers to NULL
2 'types' of lists
1. empty
  1. head == NULL
2. full or occupied
  1. head == address to a node
3 conditions to check
1. At the front
2. At the back
3. At the middle
List Traversal
1. For loop
  1. Stop when reach the next=null

Resource summary

	Created by Madeline Harlow over 10 years ago