Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
enz
on Sept 3, 2019
|
parent
|
context
|
favorite
| on:
Tree traversal without recursion: the tree as a st...
> then, when discussing how to turn recursive functions into iterators using an explicit stack (which permits breadth-first searching);
How about a depth-first search?
Join us for
AI Startup School
this June 16-17 in San Francisco!
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
How about a depth-first search?