linked lists

linked lists

1. composed of nodes

   • structs
     • one element is a pointer to the next node
     • contains the data types you want

2. saved in the heap

   • dynamic memory
     • mailoc
     • free

3. variable size

   • change in real time

4. Always started by a "head" pointer

   • first thing you always do is declare and initialize "head"pointer

5. singly linked

   • one-way pointing
     • once you go forward you can't go back UNLESS you keep track of location of previous nodes

6. End of list always represented by NULL

   • Begin by initializing pointers to NULL