Reminder that you must complete the pre-reading before each class.

On this page:
✔️ Pre-reading for Tuesday 3/23
✔️ Pre-reading for Thursday 3/25

---

Pre-readings for Binary Search, Tuesday 3/23

Essential Questions

✔️ How does the binary search algorithm work?
✔️ What’re the differences between a linear/traditional search algorithm and the binary search algorithm?
✔️ What’s the time complexity of binary search?

Read/Watch/Review

Before attending class, please complete the material below:

• Read Visual Introduction to Algorithms: Binary Search
• Watch Algorithms: Binary Search (6 min)
• Watch Linear Search vs Binary Search (5 min)

In Class

In today’s class we’ll be reviewing binary search and applying it to various data structures.

---

Pre-Reading for Binary Search Trees, Thursday 3/25

Essential Questions

✔️ What is a binary tree?
✔️ What is a binary search tree?
✔️ What makes a binary search tree special/unique?
✔️ What’re the different ways to traverse a BST?

Read/Watch/Review

For now, focus on the questions above regarding BSTs. We’ll look at implementation next week.

Before attending class, please complete the material below:

• Read Binary Search Trees
• Watch Binary Search Tree (6 min)
• Watch Binary Tree Bootcamp (20 min)

Check out this BST Visualizer

In Class

In today’s class we’ll be going over BSTs and BST traversal.