Topic 5: Red-Black Trees Online Lecture

Read Chapter 13 in your textbook before attempting this lecture. Then, proceed through the questions to practice introduced concepts. If you don't remember how binary search trees work (covered in the prerequisite, Data Structures & Algorithms), then read Chapter 12. One difference in this book is that each node knows its "parent". Perform any additional research as needed.

Your work will be reviewed to assess understanding and given any relevant feedback. However, this is a "lecture" and therefore the points assessed are not part of your grade. The instructor will review your answers after the due date and provide custom feedback if appropriate. It is very important to review answers/feedback, whether you received full credit or not, as relevant concepts may be introduced in the feedback.