Thursday - Lecture 12 - Trees
Date: July 09
Date: July 09
Today we’ll talk about another inductively defined data structure: the tree! It’s one of the most powerful data structures in CS and is incredibly useful for representing real world data. It can allow us to store “relationships” between data. However, if we have a more complex manner of data storage, it means the way we access (or traverse) this data changes. We’ll then take our CS knowledge up a notch and talk about Binary Search Trees (i.e. a brief introduction into what you’ll do in CS 214…soon to be CS 208).
In-Class Resources
| Link | Title | Type | Duration |
|---|---|---|---|
| Video 1 | Lecture 12.1 - Intro | pre-recorded | 6:34 |
| Video 2 | Lecture 12.2 - Binary Trees | pre-recorded | 5:26 |
| Video 3 | Lecture 12.3 - n-ary Trees | pre-recorded | 5:47 |
| Video 4 | Lecture 12.4 - Inductive Data Definitions | pre-recorded | 3:02 |
| Video 5 | Lecture 12.5 - Binary Search Trees | pre-recorded | 12:30 |