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
Open

tour: Traversal order #11010

marslangoog opened this issue May 31, 2015 · 3 comments
Labels
NeedsInvestigation Someone must examine and confirm this is a valid issue and not a duplicate of an existing one.
Milestone

Comments

@marslangoog
Copy link

Context: /concurrency/8

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

@minux
Copy link
Member

minux commented May 31, 2015 via email

@marslangoog
Copy link
Author

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
Copy link
Member

minux commented May 31, 2015 via email

@ianlancetaylor ianlancetaylor added this to the Unreleased milestone Jun 3, 2015
@seankhliao seankhliao added the NeedsInvestigation Someone must examine and confirm this is a valid issue and not a duplicate of an existing one. label Jul 13, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
NeedsInvestigation Someone must examine and confirm this is a valid issue and not a duplicate of an existing one.
Projects
None yet
Development

No branches or pull requests

4 participants