Quiz 3 study guide

• Trees - Runtimes, properties, and operations on trees.
• Trees - binary trees and expression trees.
• Sorting - all sorting algorithms covered so far and their runtimes.
  • Be able to demonstrate a particular sorting algorithm (so the sorting problems from homework 4).
  • Analyze or prove stability for a given sorting algorithm.
  • What must you consider when choosing a sorting algorithm to use.
• Any coding question will be coding for a tree operation (not remove) and not sorting. Tree operations may be for an array (make sure you know how to find the parent and the right and left children) or linked implementation. The operation may not be something that you have seen already.