1 / 39

Figure 4.1 a) A linked list of integers; b) insertion; c) deletion

Figure 4.1 a) A linked list of integers; b) insertion; c) deletion. Figure 4.2 A reference to an Integer object. Figure 4.3a-d a) Declaring reference variables; b) allocating an object; c) allocating another object, with the dereferenced object marked for garbage collection.

vnelson
Download Presentation

Figure 4.1 a) A linked list of integers; b) insertion; c) deletion

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Figure 4.1 a) A linked list of integers; b) insertion; c) deletion

  2. Figure 4.2 A reference to an Integer object

  3. Figure 4.3a-d a) Declaring reference variables; b) allocating an object; c) allocating another object, with the dereferenced object marked for garbage collection

  4. Figure 4.3e-g e) allocating an object; f) assigning null to a reference variable; g) assigning a reference with a null value

  5. Figure 4.4 The value of a parameter does not affect the argument’s value

  6. Figure 4.5 A node

  7. Figure 4.6 The result of linking two instances of IntegerNode

  8. Figure 4.7 Using the Node constructor to initialize a data field and a link value

  9. Figure 4.8 A head reference to a linked list

  10. Figure 4.9 A lost node

  11. Figure 4.10 The effect of the assignment curr = curr.getNext( )

  12. Figure 4.11 Deleting a node from a linked list

  13. Figure 4.12 Deleting the first node

  14. Figure 4.13 Inserting a new node into a linked list

  15. Figure 4.14 Inserting at the beginning of a linked list

  16. Figure 4.15 Inserting at the end of a linked list

  17. Figure 4.16 When prev references the last node and curr is null, insertion will be at the end of the linked list

  18. Figure 4.17 When prev is null and curr references the first node, insertion or deletion will be at the beginning of the linked list

  19. Figure 4.18 A reference-based implementation of the ADT list

  20. Figure 4.19 A head reference as an argument

  21. Figure 4.20 a) A sorted linked list; b) the assignment made for insertion at the beginning of the list

  22. Figure 4.21a and 4.21b a) The initial call insert Recursive(head, newItem); b) the first recursive call

  23. Figure 4.21c c) the second recursive call inserts at the beginning of the list that headNode references

  24. Figure 4.22 A linked list with head and tail references

  25. Figure 4.23 A circular linked list

  26. Figure 4.24 A circular linked list with an external reference to the last node

  27. Figure 4.25 A dummy head node

  28. Figure 4.26 a) A dummy head node with global information; b) a head record with global information

  29. Figure 4.27 A doubly linked list

  30. Figure 4.28 a) A circular doubly linked list with a dummy head node; b) an empty list with a dummy head node

  31. Figure 4.29 Reference changes for deletion

  32. Figure 4.30 Reference changes for insertion

  33. Figure 4.31a and 4.31b a) Inventory list node; b) wait list node

  34. Figure 4.31c c) orthogonal structure for the inventory

  35. Figure 4.32 Linked list for Self-Test Exercise 2, 3, and 7

  36. Figure 4.33 Two circular linked lists

  37. Figure 4.34 A sparse polynomial

  38. Figure 4.35 a) An array-based implementation of the linked list in Figure 4-32; b) after inserting D in sorted order; c) after deleting B

More Related