Opening Recursion Trees and Binary Search Trees (MIT 6.006 Recitation 5)
Recursion Trees and Binary Search Trees (MIT 6.006 Recitation 5)
- Length
- 59 min
- Level
- Undergraduate
- Recorded
- MIT2013
Chapter 1 of 7: Before the lecture
Analyzes the merge sort recurrence with recursion trees and traces binary search tree deletion cases.
MIT 6.006: Introduction to Algorithms covers merge sort analysis and binary search tree operations in this undergraduate recitation. Costan shows how a successor replaces a node with two children during deletion and how trees store extra information at each node.
MIT 6.006: Introduction to Algorithms covers merge sort analysis and binary search tree operations in this undergraduate recitation. Costan shows how a successor replaces a node with two children during deletion and how trees store extra information at each node.

This lecture
Lecture 26 of 31 of Introduction to Algorithms.
Choose a node to see how it connects to this lecture. What comes before is on the leftat the top. What comes after is on the rightat the bottom. The ring is what it teaches. People and places are above. Other lectures and books are below.
Press a chosen node again to open it.
Your comment is kept while you sign up.Sign in