Lecture 21. Binary Search Trees, Part I

Binary search trees are flexible and powerful data structures for storing collections of data in sorted order. Today we explore the basics of how BSTs work.

Readings

• Readings: Chapter 16.1 - 16.2

Links

• Video on canvas

📦 Code and Slides

• Lecture Slides.pdf
• Preliminary Lecture Code.zip