19. Python Chapter 8.1–8.3 — collections and linked lists - revision mindmap
All mindmaps · Full chapter · Practice answers
Open full-resolution image · Printable collection - page 19
The map is a completed revision summary. Cover a branch and reconstruct it, then try the linked chapter practice. Read the image at full size when labels are small.
Text version
ADT and representation
- Behaviour/interface versus storage
- Homogeneous/heterogeneous and linear/non-linear
- Singly linked node: data plus next reference
- Head gives first node; null marks empty/end
Traverse and locate
- current begins at head
- Process existing node, then advance
- Length, search, read and update
- Index access requires traversal; keep predecessor when needed
Insert
- Head: new points to old head
- Middle/end: preserve successor then redirect previous
- Positional: validate 0 through length
- Sorted: comparison boundary and duplicate policy
Delete
- Head change versus predecessor bypass
- Return changed head where required
- Maintain tail if implementation has one
- Missing target and singleton-to-empty cases
Costs and scope
- Links use memory; no contiguous placement required
- Locating position may take traversal
- No shifting once relevant link is known
- Doubly/circular linked lists excluded; array free-list is optional reference
Worked example & exam traps
- Before: head → A → C → None. Insert B after A.
- First B.next = A.next; then A.next = B → A → B → C.
- Delete B: A.next = B.next → A → C. Preserve the successor.
- Avoid: test current.next and omit last node; lose successor; discard returned head
Sources and reading
This map condenses Chapter 19 and its source trail. Use the self-learning reading guide for the corresponding VJC pages and A notes. It does not add topics to the stated promo scope.