Talk:Tree from nesting levels: Difference between revisions

Talk:Tree from nesting levels (view source)

Revision as of 15:24, 2 February 2021

485 bytes added , 3 years ago

The generated tree datastructure (sic) should ideally be in a languages nested list format that can be used for further calculations rather than something just calculated for printing

Nigel Galloway

2,171

edits

Revision as of 12:44, 2 February 2021 (view source) Hout (talk \| contribs) m (→‎History or provenance of this data-structure ?) ← Older edit		Revision as of 15:24, 2 February 2021 (view source) Nigel Galloway (talk \| contribs) (The generated tree datastructure (sic) should ideally be in a languages nested list format that can be used for further calculations rather than something just calculated for printing) Newer edit →
Line 18: :: then show a notation that would have no defined meaning in more strictly typed languages. :: (but the stakes are not high :-) [[User:Hout\|Hout]] ([[User talk:Hout\|talk]]) 12:43, 2 February 2021 (UTC) ==The generated tree datastructure (sic) should ideally be in a languages nested list format that can be used for further calculations rather than something just calculated for printing== Perhaps it would be clearer if the task required further processing. I would suggest at least add an item, delete an item, union of two trees, and subset of a tree according to a predicate.--[[User:Nigel Galloway\|Nigel Galloway]] ([[User talk:Nigel Galloway\|talk]]) 15:24, 2 February 2021 (UTC)