Timeline for How to perform a depth-first in-order traversal of an expression?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 11, 2018 at 17:04 | comment | added | alancalvitti | @Mr.Wizard, as left and right branches have been assigned an order, why can't 3 or more branches be similarly ordered? | |
| Sep 10, 2017 at 16:15 | vote | accept | Mr.Wizard | ||
| Apr 13, 2017 at 12:55 | history | edited | CommunityBot |
replaced http://mathematica.stackexchange.com/ with https://mathematica.stackexchange.com/
|
|
| Mar 22, 2017 at 0:03 | comment | added | Mr.Wizard | @wxffles It was a quick fix so I self-answered instead of deleting. | |
| Mar 22, 2017 at 0:02 | answer | added | Mr.Wizard | timeline score: 7 | |
| Mar 21, 2017 at 23:50 | history | edited | Mr.Wizard | CC BY-SA 3.0 |
added 103 characters in body
|
| Mar 21, 2017 at 20:24 | comment | added | wxffles | For the GIH branch, how does one decide which is left and which is right? | |
| Mar 21, 2017 at 19:34 | comment | added | Mr.Wizard | @LeonidShifrin Good question. I cannot. I found the example in isolation interesting and wondered if there were already Mathematica functions that implement this, or other standard methods. The Wikipedia description applies to a binary tree, and I don't think this generalizes to an arbitrary number of leaves, as it visits the root node between left and right branches. | |
| Mar 21, 2017 at 19:03 | comment | added | Leonid Shifrin | Can you define in-order traversal for a generic tree (not necessarily binary)? What would that mean? | |
| Mar 21, 2017 at 18:57 | history | asked | Mr.Wizard | CC BY-SA 3.0 |