Quiz 3 study guide

• Trees - Do assignment and homework problems. If you understand the BST property, you should be able to answer the critical thinking questions about trees. You will have 1 tree coding question but it won't be anything you haven't seen before.
• Choosing a good ADT - Given a particalar set of operations or a defined project, analyze and choose the best ADT implementation
• Priority Queues - What are they? Anaysis of running time using different ADTs to implement a priority queue
• Heaps - Properties of a min and max heap. Operations on heaps.
• Sorting - heapsort and treesort
• Run times for tree and heap operations