Explains box-and-pointer diagrams for lists, including nested lists, indexing, and primitive versus compound values.
Save to open this file
Berkeley CS61A: Structure and Interpretation of Computer Programs
All
- 01-Welcome
02-Functions
- 02-Functions
- 03-Control
- 04-Higher-Order Functions
- 05-Environments
- 06-Abstraction
- 07-Function Examples
- 08-Midterm 1 Review
- 09-Recursion
- 10-Tree Recursion
- 11-Sequences
- 12-Containers
- 13-Objects
- 14-Linked Lists
- 15-Trees
- 16-Midterm 2 Review
- 17-Problem Solving
- 18-Mutation
- 19-Classes
- 20-Attributes
- 21-Inheritance
- 22-Iterators
- 23-Generators
- 24-Efficiency
- 25-Object Examples
- 26-Midterm 3 Review
- 27-Functional Programming
- 28-Algebraic Data Types
- 29-Immutable Data
- 30-Interpreters