they add up to a substantial chunk of thinking, we won't officially
require you to do them, since we don't want to get into a bureaucratic
bind if you've planned your next month in a way that would not permit
-you to get the work done. But we strongly encourage you to work on
+you to get the work done. But ***we strongly encourage*** you to work on
the problem set: solving these problems will produce a qualitatively
deeper understanding of continuations. If you plan to do some or all
of these problems, and would like us to take them into account in our
As Ken Shan points out, this is an instance of the algorithm
for converting name/year citations (like 'see Montague 1970')
- to numerals corresponding to their ('see [24]'). Except that
- bibliograpic numerals don't start with zero.
+ to numerals corresponding to their position in the
+ bibliography ('see [24]'). Except that bibliographic numerals
+ don't start with zero.
Give some thought to efficiency: there are straightforward
solutions that involve traversing the tree once (in order to,
its number of occurrences in the tree. Is there any way to do
that with a single traversal?
- You can assume that the tree is leaf-labeled (no labels on the
- internal nodes), and that the leafs are, say, chars.
+ You can assume that the tree is binary, leaf-labeled (no
+ labels on the internal nodes), and that the leafs are, say,
+ chars.
Here is [a hint](/hints/assignment_10_hint).