Freeing Linked Structures

• Save a pointer to the front element
• Advance the beginning pointer past the front element
• Free memory used by front element

  void freeList(list lst) {
      while ( lst != NULL ) {
          list save = lst;
          lst = lst->rest;

      }
  }