# Week 11

:::{topic} Learning goals
- explain how *linked list* stores data
  - contrast this with how an array stores data.
- evaluate a given problem to determine whether a linked list or an array would be the more appropriate data structure.
- use a linked list to navigate through its nodes
- explain how a node is inserted & deleted in a linked list
:::

<!--
, stack, queue* and *tree* store data
- choose a data structure for a given application (including array)
-->

:::{toctree}
:maxdepth: 1
week11/playlist.md
week11/linked-list.md
week11/appendix
:::