I'm solving the exercise from A Tour of Go, Equivalent Binary Tree.
This exercise requires one to implement a Walk function which is supposed to walk a tree and send all values orderly from the tree to a channel.
The exercise statement states:
... We'll use Go's concurrency and channels to write a simple solution.
Reading that line, I think it is challenging to implement the Walk in a way that it launches a goroutine for each left/right …