-b. Review the tree_monadizer application of continuations that maps a
-tree to a list of leaves in [[manipulating trees with monads]]. Spend
-some time trying to understand exactly what it does. Suggestion:
-compute the transformation for a tree with two leaves, performing all
-beta reduction by hand using the definitions for bind_continuation and
-so on. If you take this route, study the description of streams (a
-particular kind of data structure) below. The goal will be to arrange
-for the continuation-flavored tree_monadizer to transform a tree into
-a stream instead of into a list. Once you've done that, completing
-the same-fringe problem will be easy.
+2. Review how the continuation-flavored tree\_monadizer managed to
+ map a tree to a list of its leaves, in [[manipulating trees with monads]].
+ Spend some time trying to understand exactly what it
+ does: compute the tree-to-list transformation for a tree with two
+ leaves, performing all beta reduction by hand using the
+ definitions for bind\_continuation, unit\_continuation and so on.
+ If you take this route, study the description of **streams** (a
+ particular kind of data structure) below. The goal will be to
+ arrange for the continuation-flavored tree_monadizer to transform
+ a tree into a stream instead of into a list. Once you've done
+ that, completing the same-fringe problem will be easy.