15-150: Principles of Functional Programming

Lecture 8: Sorting Trees

We implemented mergesort for trees.
We showed that there is considerable opportunity for parallelism compared with mergesort for lists.
We discussed tree rebalancing.

Key Concepts

Sample Code

Some Notes on Sorting Trees