News for hackers. Stuff that matters.
Re:Space Requirements for Tree Traversal by mschuetz on Sunday October 09, 2016 @11:35AM (#12671650)
I believe "Iterative deepening depth-first search" should be mentioned since the result is equivalent to breadth-first search but the memory efficiency is basically the same as depth-first search. It also tends to be faster than breadth-first search due to the lower memory complexity.

https://en.wikipedia.org/wiki/Iterative_deepening_depth-firs...

Re:Space Requirements for Tree Traversal by eeojun on Monday October 10, 2016 @08:55AM (#12676766)
Oh boy, this is great. Thanks! I was not aware of this when I wrote the article/post. I started out by wanting to make a very generalised pair of expressions for the space requirements so I had to make very little assumptions and would be able compare it to efficiency gains by other algorithms/representations.

Again thanks, I'll try to include it this week end if I have the time.

Re:Space Requirements for Tree Traversal by Okkef on Sunday October 09, 2016 @12:34PM (#12671921)
I came here to say this :)