There are a number of dynamic data structures which you are required to understand. What makes them different from static data structures is the fact that they can grow or shrink easily. The more data you add, the more data they can hold. The four you are expected to know about are

• Linked lists
• Binary trees
• Stacks
• Queues

We have already looked at these in some detail, however we have not looked directly how to write code to implement them. This will be the focus of the rest of this handout.