Linked Lists and Stacks - Chapter 10

Singly-Linked Lists

• Contains a pointer to another instance of the same structure
• Files
  • list.h: definition of Element and List
  • dolist.h: list creation (i) iteratively and (ii) recursively
  • util.c: print, count, concatenate, insert, delete
  • main.c: activation of the above
  • makefile
  • list: the executable

  typedef char 			Data;	/* will use char in examples */
  
  struct linked_list {
    Data d;
    struct linked_list * next;
  };
  
  typedef struct linked_list	Element;
  typedef Element *		List;
  
  /* Funution prototype */
  
  extern List str2list_it(char *);
  extern List str2list_rec(char *);
  extern void print_list(List);
  extern int count_rec(List);
  extern int count_it(List);
  extern void concatenate(List, List);
  extern void delete_list(List);
  

• list.h
• dolist.c
• util.c
• main.c
• makefile

Stacks

• A last-in-first-out (LIFO) structure - the last item to be pushed onto the stack is the first item to be popped off.
• Comparing stacks of char's that are fully preallocated (static) or dynamically allocated
• Files
  • stack_static.h, stack_static.c: we have already seen this when studying structures and arrays
  • stack_dynamic.h, stack_dynamic.c: the linked-list version
  • main.c with conditional compilation
  • makefile
• main.c
• stack_dynamic.c
• stack_dynamic.h
• stack_static.c
• stack_static.h
• makefile.h