Day 3: A Different Way to Connect Data

After reading this chapter and engaging in the embedded activities and reflections, you should be able to:

• Compare memory organization of arrays vs linked structures
• Create simple Node classes with data and reference fields
• Draw schematic representations of linked list operations
• Trace linked list traversal step-by-step
• Traverse a singly linked list procedurally
• Search in a singly linked list procedurally
• Compare Java references with C/C++ pointers (optional)