Timeline for How to construct a tree from a preorder traversal
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 8, 2021 at 13:01 | answer | added | kglr | timeline score: 2 | |
| Jun 8, 2021 at 7:46 | answer | added | kglr | timeline score: 2 | |
| Jun 7, 2021 at 16:37 | vote | accept | High Performance Mark | ||
| Jun 7, 2021 at 12:00 | history | tweeted | twitter.com/StackMma/status/1401871597741522952 | ||
| Jun 6, 2021 at 21:06 | history | became hot network question | |||
| Jun 6, 2021 at 18:53 | answer | added | Michael E2 | timeline score: 13 | |
| Jun 6, 2021 at 17:12 | answer | added | Edmund | timeline score: 5 | |
| Jun 6, 2021 at 15:20 | answer | added | Ben Izd | timeline score: 4 | |
| Jun 6, 2021 at 14:20 | comment | added | Michael E2 | Yep, TreeForm has been around so long, it's about time something like Tree has surfaced at the user level. | |
| Jun 6, 2021 at 14:15 | comment | added | High Performance Mark | No, Tree[n,{}] shouldn't occur, that would just be a leaf at level n. Tree looks quite neat and I'm trying to figure out how to use it to replace a lot of old code I have which uses the existing Graph type for manipulating what are really Trees. | |
| Jun 6, 2021 at 14:12 | comment | added | Michael E2 | So the second argument (in your use-cases) would always be a nonempty list? For instance, Tree[4, {}] could not occur? | |
| Jun 6, 2021 at 13:02 | history | asked | High Performance Mark | CC BY-SA 4.0 |