Talk:Tree datastructures: Difference between revisions
m
→Deriving a tree from a list of lines with their indent levels
Line 63:
The head tree:
- has the first line of the outline as its value
- and has a (possibly empty) child list
which is the forest structure of all the lines (if any) which:
-
- and
(the next line that shares the first's indent level)
The tail forest has the structure of the remaining outline,
| |||