Add a depth-first search algorithm over any tree

I saw that somebody has started working on a breadth-first search algorithm over any tree here. I thus thought maybe I could work on a depth-first search algorithm over any tree concurrently.

Thus just wanted to check if this is OK, and any information I should know beforehand / information that would be helpful.



Being able to iterate in depth-first ordering over a tree would be very useful. I imagine the API for depth-first ordering would be similar to that of breadth-first. I anticipate there being some feedback on that API (a struct conforming to Sequence). I would probably recommend waiting to hear some of that feedback before beginning your implementation. Or, anticipate that the feedback given for BFS API would probably also apply to a DFS API.

1 Like

OK sure. Will keep a tab on this issue, looks very interesting.