Today we’ll talk about how data structures can be utilized to improve the efficiency of our functions. While this doesn’t usually matter at the scale of our class, when you get into real world data…things get very large very quick. Specifically we’ll be talking about Binary Search Trees and how we can utilize them to quickly access data in large databases.
As we start to get more and more complex in our data definitions, the functions we use to access them also become more complex. We as humans sometimes need a little help with writing our programs. Keep in mind DrRacket is literally built to help you understand the function’s you’re writing. In particular when working on traversal of inductively defined data, the Stepper can be an invaluable “debugging tool” when writing your programs. Checkout more details on our DrRacket Cheatsheet!
Today's Resources
1. Exercise Files
Download Exercise Files2. Slides
3. Pre-Recorded Lecture Video(s), Mini-Quizzes, and Live Recordings
| Link | Title | Type | Duration |
|---|---|---|---|
| Video 0 | Live Lecture Recording | lecture | 50:00 |
4. Mini-Quiz 11: Binary Search Trees
If you did not participate in class or were unable to attend then you should use this Canvas Quiz as a substitute.