Binary Search Trees

Welcome to week 9! Watch the video below to get an overview of the coming week.

Learning objectives

By the end of this week, you will be able to:

• Explain the concepts of data dictionaries and binary search trees (BSTs)
• Trace the execution of searching, insertion, and deletion in a BST
• Write efficient procedures in Python that operate on BSTs
• Explain the importance of balance in a search tree
• Construct and use 2-3 trees as a balanced BST

What's due this week

• Week 9 Quiz on Thursday (on Gradescope)
• Peer Interview 4 Reflection on Sunday
• Assignment 5 on Sunday