Talk:Tree from nesting levels: Difference between revisions
→The target outputs shown clash with the task description
Line 94:
[[(None, [(None, [(3, []), (3, []), (3, [])])])], [(1, [])], [(1, [(None, [(3, []), (3, []), (3, [])])])]]</lang>
[[User:Hout|Hout]] ([[User talk:Hout|talk]]) 14:00, 4 February 2021 (UTC)
: Sorry, but what's wrong with a tree with multiple nodes at level 1? I mean, even a binary tree has got 2''!''<br>
: What is the purpose or benefit of littering up the nested structures (a better name?) with all those None?<br>
: What about programming languages where not everything ''has'' to be a tuple (whatever ''that'' its)?<br>
: It seems to me you're trying to forcefully impose functional programming rules or something onto this task. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 17:24, 4 February 2021 (UTC)
| |||