Talk:Tree datastructures: Difference between revisions
Content added Content deleted
| Line 54: | Line 54: | ||
==Deriving a tree from a list of lines with their indent levels== |
|||
For what its worth, a declarative description which is also a recursive algorithm might look something like: |
For what its worth, a declarative description which is also a recursive algorithm might look something like: |
||
<pre>If a forest is understood as a list of trees, |
<pre>If a forest is understood as a list of trees, |
||