Anonymous user
Tree datastructures: Difference between revisions
Trolling not golfing is mocked.
(Trolling not golfing is mocked.) |
|||
Line 7:
wiki
mocks
A common datastructure for trees is to define node structures having a name and a, (possibly empty), list of child nodes. The nesting of nodes captures the indentation of the tree. Lets call this '''the nest form'''.
Line 34:
;Note:
* It's all about showing aspects of the contrasting datastructures as they hold the tree.
* The word "golfing" may be substituted by "trolling" in the tree as golfing can be friendly fun! (just not for RC examples).▼
* Comparing nested datastructures is secondary - saving formatted output as a string then a string compare would suffice for this task, if its easier.
▲* The word "
<br>
| |||