Welcome to Lesson 12!

Learning Objectives
By the end of this class, you should know...

  • The AVL Tree ADT
  • The Heap ADT
  • Quiz 4 on Thursday on Trees, Binary Trees and Binary Search Trees
  • New Lab Posted - BST Part 2
    • Can be adapted for the final project
    • Consider making the person who has the best implementation of the BST the person in charge of the BST portion of the project
    • Or, if you are that person, help out the BST specialist on your team.

Review Activity

  • Insert the following values into a BST in this order: 7, 0, 2, -10, 5, 100, 8, 13, 9, 88, -12, 3
  • Trace inOrder, preOrder and postOrder print on the resulting BST
  • Write the above 3 functions (the helper functions not the wrappers)

Today's Lesson

1. AVL Trees (Brief discussion, no implementation)

2. Heaps <- Will Be Used for Project Priority Queue

Upcoming Assignments