Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

tour: Traversal order #11010

Open
marslangoog opened this issue May 31, 2015 · 3 comments

Comments

@marslangoog
Copy link

commented May 31, 2015

Context: /concurrency/8

It should be made clear that Walk function should traverse the tree in-order.

@minux

This comment has been minimized.

Copy link
Member

commented May 31, 2015

@marslangoog

This comment has been minimized.

Copy link
Author

commented May 31, 2015

Similar to #11009, I think the key here is whether the exercise expects the user to

  1. read from Walk's channel and store the result in an array, sort it, then compare; or
  2. iterate on the channels and compare element by element without sorting

If 2, Walk must traverse in-order.

@minux

This comment has been minimized.

Copy link
Member

commented May 31, 2015

@ianlancetaylor ianlancetaylor added this to the Unreleased milestone Jun 3, 2015

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
3 participants
You can’t perform that action at this time.