•For example, let’s manage a linked list of arrays, where each array contains 10 data items
–we figure that even if all 10 are not used in a given node, that wasting 9-0 data “cells” is trivial
–commonly called a “flexible array”
–struct
node {
•data
fixed_array[SIZE];
•node
* next;
•};
