Page history
Talk:Tree datastructures
20 October 2019
19 October 2019
Hout
→Orthographic linting
m+1
rosettacode>Paddy3118
→A generic tree to indent-type datastructure converter: filled.
+573
rosettacode>Paddy3118
→Deriving a tree from a list of lines with their indent levels: New section
+59
18 October 2019
rosettacode>Paddy3118
→Attribution: sp.
mrosettacode>Paddy3118
→And when comparison has children?: Noted.
+284
Hout
→Good idea for a task – a couple of thoughts.
+332
rosettacode>Paddy3118
→Good idea for a task – a couple of thoughts.: Lets do it :-)
+335
17 October 2019
Hout
→Deriving a tree from a list of lines with their indent levels
m−2
Hout
→Deriving a tree from a list of lines with their indent levels
m+27
Hout
→One description (and algorithm) for the indents -> tree relationship
+1,000
Hout
no edit summary
m+3
Hout
→Sample outline – something perhaps a bit more plausible and motivating
+681
rosettacode>Paddy3118
→Attribution: Noted.
+286
rosettacode>Paddy3118
→Attribution.
m+17
rosettacode>Paddy3118
→Good idea for a task – a couple of thoughts.: Some answers...
+751
16 October 2019
Hout
→Good idea for a task – a couple of thoughts.
m+147
rosettacode>Paddy3118
→Good idea for a task – a couple of thoughts.: Cold.
+179
Hout
→And when comparison has children?
+19
Hout
→And when comparison has children?
+9
Hout
→And when comparison has children?
+302
Nigel Galloway
And when comparison has children?
+141