CIS 2500 Lecture Notes - Lecture 16: Linked List, C Dynamic Memory Allocation

• School: University of Guelph
• Department: Computing and Information Science
• Course: CIS 2500
• Professor: Deborah Stacey

Document Summary

//where struct data is the structure being typedef"d and info is the new type name. Now you can use info anywhere in your program where struct data would have been placed. Alternate syntax another syntax for typedef is to include it in the struct definition same as the previous typedef but combines two operations - declaring the struct and creating a type typedef struct { int count; char name[30]; A data structure is used to organize structure data so that it is easy to manipulate (search, order, retrieve) A list or linked list is a common structure with many applications it is also one of the easiest dynamis structures to build and use. Pointers are used to attach elements in the list into a chain. Elements in the list are usually structures root/head is the start of the list is apointer. Each elements of the list points to the next one last element of the list points to null.