Talk:Tree from nesting levels: Difference between revisions
m
→The target outputs shown clash with the task description
Line 72:
To put this in a Python notation, if we '''start''' with one of these forests ('''lists''' of trees), mapping over each of its members with a foldTree catamorphism, passing a function like this to it:
<
'''A Tree in which
A possible integer, and a list of trees.
(Int or None, [Tree])
Line 82:
else:
return (x.get('Just', 0), concat(xs))
return go</
We can obtain a self-consistent representation of these forests as lists of tuples, in which the first value is a kind of sum type (Int or None), and the second value is itself a (possibly empty) forest:
| |||