Outline:

1. Questions?
2. Quiz #6
3. Binary search trees
   • recap: binary trees
   • properties of a BST
   • BST operations:
     • querying a BST
     • insertion into a BST
     • example implementation: BinarySearchTree.kt
4. Wrap-up

What’s next

Upcoming assignments:

• Assignment 4 resubmissions are due tonight at 10pm!
• Assignment 5 is due Wednesday at 10pm
• Assignment 6 will be released Wednesday

Upcoming events:

• CS Bits & Bytes this week features Dr. Betty Cheng, a professor at Michigan State University, talking about trustworthy AI – attend the talk and write up two paragraphs to earn a token for an extra assignment resubmission

What you should do now:

• The readings (see below)
• Finish Assignment 5 and resubmit Assignment 4

Reading assignment (to be completed by the next class):

Binary search trees (from today):

• Binary trees
• Binary search trees

Prefix trees (for next time):

• Prefix trees (a.k.a. “tries”)