1. Define the following terms:
   • data structure
   • binary tree
   • root node
   • node
   • list
   • array
   • iterate through a list
   • queue
2. How do programmers decide what data structures to use for different programs?
3. Why is a queue a good data structure to use for keeping track of documents to be printed on a network printer?
4. Why would a binary tree be a good data structure to use for storing a dictionary on a computer?
5. What is the difference between using the Do together and the For all together instructions in an Alice world?
6. If we were to build some classes to implement data structure such as a queue, a binary tree, and a list, what methods would be necessary? For example, addAnElement, would be necessary for all three.

See readings for study material on inheritence, writing our own functions, and additional readings on lists, and arrays.