Quiz 3 study guide

• Trees, Binary Trees and Binary Search Trees - Runtimes, properties, and operations on trees. You will have 1 tree coding question and it may be anything, maybe even something you haven't seen before (implementing the print sideways function from as3 may help you.)
• Make sure you know how to do the stack based algorithm for building an expression tree from a postfix expression
• Evaluating 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 the homework).
  • Analyze or prove stability for a given sorting algorithm.
  • What must you consider when choosing a sorting algorithm to use.