3.  Head pointer  Last node  Build a complete linked list  Node deletion  Node insertion  Helpful hints

4. struct entry { int value; entry* next; }; int main() { entry* head = &n1; entry n1, n2, n3; n1.next = &n2; n2.next = &n3; n3.next = 0; n1.value = 100; n2.value = 200; n3.value = 300; // remove n2 from list n1.next = n2.next; return 0; }

5. entry n1, n2, n3; n1.next = &n2; n2.next = &n3; n3.next = 0; entry* head = &n1; n1.value = 100; n2.value = 200; n3.value = 300; n1 n1.valuen1.next n2 n2.valuen2.next n3 n3.valuen3.next 100 200300 (56c) (7fa)(88b) 7fa 88b 0 56c head

6. abcde 0 Head acde 0 Head

7. // remove n2 from list n1.next = n2.next; n1 n1.valuen1.next n2 n2.valuen2.next n3 n3.valuen3.next 100 200300 (56c) (7fa)(88b) 7fa 88b 0 56c head n1 n1.valuen1.next 100 (56c) 88b n3 n3.valuen3.next 300 (88b) 0 56c head

8. abcde 0 Head f

9. struct entry { int value; entry* next; }; int main() { entry n1, n2, n3; n1.next = &n2; n2.next = &n3; n3.next = 0; entry* head = &n1; n1.value = 100; n2.value = 200; n3.value = 300; // insert node n23 after n2 entry n23; n23.value = 250; n23.next = n2.next; n2.next = &n23; return 0; }

10. entry n23; n23.value = 250; n1 n1.valuen1.next n2 n2.valuen2.next n3 n3.valuen3.next 100 200300 (56c) (7fa)(88b) 7fa 88b 0 56c head n23 n23.value n23.next 250 (4ad)

11. n23.next = n2.next; n2.next = &n23; n1 n1.valuen1.next n2 n2.valuen2.next n3 n3.valuen3.next 100 200300 (56c) (7fa)(88b) 7fa 4ad 0 56c head n23 n23.value n23.next 250 (4ad) 88b

12. n2.next = &n23; n23.next = n2.next; n1 n1.valuen1.next n2 n2.valuen2.next n3 n3.valuen3.next 100 200300 (56c) (7fa)(88b) 7fa 4ad 0 56c head n23 n23.value n23.next 250 (4ad) 4ad

13. entry n1; entry* head = &n1; n1.value = 100; n1.next = 0; head n1(67c) n1.valuen1.next 67c Legal head->value head->next n1.value n1.next Illegal head.value head.next n1->value n1->next 100 0

14. Head pointer Last node Build a complete linked list Node deletion Node insertion Helpful hints