Recursion, Trees & Heaps
A study companion for the LG4–LG6 readings: designing and analyzing recursion, general and binary trees, search trees and AVL trees, and priority queues built on heaps. Every code fragment from the reading can be run step by step on your own input.
- Read, then runEach section explains the idea in plain words first, then the textbook definition, then an example you can play with.
- Step through the codeEdit the input of a code lab, press Run trace, and use Next or the arrow keys to watch each line, the call stack, and a picture of the data.
- Check yourselfEvery section ends with questions that explain their answers, plus a short list of takeaways for review.