Talk:Tree from nesting levels: Difference between revisions

Content added Content deleted

Inline

Revision as of 10:10, 2 February 2021

History or provenance of this data-structure ?

Are we sure that this is the most useful representation of 'missing' levels ?

The integers here are carrying a dual load – both as the value of a tree node, and as indicators of nesting depth.

The structure appears to slightly crack under its own weight, losing a bit of recursive coherence and easy traversability, at the point where a nesting level is skipped, and we get nodes with missing values.

Before we jump in with examples in different languages, are you sure that this data-structure has stabilised ? Does it have a history or provenance that you can reference ? Hout (talk)

I expect it to be an exercise. More the maths side than engineering, although someone *did* have the need.

I think it is ripe for first examples; as of writing, the Julia and Phix examples were completed OK, so I think they were able to follow my task description. Are you having problems following the task?

--Paddy3118 (talk) 10:10, 2 February 2021 (UTC)

@@ Line 8: / Line 8: @@
 Before we jump in with examples in different languages, are you sure that this data-structure has stabilised ? Does it have a history or provenance that you can reference ? [[User:Hout|Hout]] ([[User talk:Hout|talk]])
+: I expect it to be an exercise. More the maths side than engineering, although someone *did* have the need.
+:I think it is ripe for first examples; as of writing, the Julia and Phix examples were completed OK, so I think they were able to follow my task description. Are you having problems following the task?
+:--[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 10:10, 2 February 2021 (UTC)