Week 07 Notes for CS 3100

• Take Roll.
• Level Three version of the clinic program is due friday.
• We are studying binary trees
  • Why Use A Binary Search Tree for a Keyed List (Table)?
  • Various Ways to represent Binary Trees
  • Complexity of Average Search in a 3-Node BST
  • Complexity of Average Search in a 4-Node BST (A)
  • Complexity of Average Search in a 4-Node BST (B)
  • Complexity of Average Search in an n-Node Binary Search Tree