1. A First Book of ANSI C Fourth Edition Chapter 13 Dynamic Data Structures

5. Introduction to Linked Lists (continued)

6. Introduction to Linked Lists (continued)

8. Introduction to Linked Lists (continued)

9. Introduction to Linked Lists (continued)

10. A structure can contain any data type, including a pointer. A pointer member of a structure is used like any other pointer variable. Introduction to Linked Lists (continued)

11. is evaluated as (t1.nextaddr)->name it can be replaced by (*t1.nextaddr).name Introduction to Linked Lists (continued)

12. Introduction to Linked Lists (continued)

13. Introduction to Linked Lists (continued) Disadvantage: exactly three structures are defined in main() by name, and storage for them is reserved at compile time

14. Introduction to Linked Lists (continued) can be replaced by while(!contents)

15. Dynamic Memory Allocation

17. Necessary because malloc() returns void Dynamic Memory Allocation (continued) …

20. Stacks (continued)

23. PUSH and POP (continued)

24. PUSH and POP (continued)

25. PUSH and POP (continued)

26. PUSH and POP (continued)

29. Queues (continued)

30. Queues (continued)

32. Enque and Serve (continued)

34. Enque and Serve (continued)

36. Enque and Serve (continued)

37. Enque and Serve (continued)

38. Enque and Serve (continued)

39. Enque and Serve (continued)

40. Enque and Serve (continued)

43. INSERT and DELETE Key field

45. INSERT and DELETE (continued)

47. See Slide 50 See Slide 50 INSERT and DELETE (continued)

48. INSERT and DELETE (continued)

49. INSERT and DELETE (continued)

50. INSERT and DELETE (continued) ...(code for insert() and locate() goes here)…

54. Common Compiler Errors

55. Common Compiler Errors (continued)