Motivation -- Approach 1: Direct access, no encapsulation

• Client code for Array:

for (I = 0; I < MAX; I++) {

ProcessItem (arr[I]);

}

• Client code for Linked List:

p = pList;

while (p) {

ProcessItem (*p);

p = p->Next;

}

• Client code for Binary Tree:

[more complicated, recursive algorithm]