You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I really like this exercise as it requires some use of most of the concepts in the tour which is fitting as one of the final exercises.
I am confused about one part though. The exercise states: "Then read and print 10 values from the channel. It should be the numbers 1, 2, 3, ..., 10."
This sets an invalid expectation for implementations of Walk that it will yield the sorted contents regardless of the tree structure. The examples given on the previous page show two trees which, if traversed using the same algorithm (preorder, in-order, post-order) will yield values out of order. This seems to be the given intention of the exercise, to detect alternate structures.
The statement should be amended so as not to give the expectation that values will be listed in numeric order so that learners can simply choose any one conventional traversal algorithm to do the comparison of structure.
The text was updated successfully, but these errors were encountered:
Context: https://go.dev/tour/concurrency/8
I really like this exercise as it requires some use of most of the concepts in the tour which is fitting as one of the final exercises.
I am confused about one part though. The exercise states: "Then read and print 10 values from the channel. It should be the numbers 1, 2, 3, ..., 10."
This sets an invalid expectation for implementations of Walk that it will yield the sorted contents regardless of the tree structure. The examples given on the previous page show two trees which, if traversed using the same algorithm (preorder, in-order, post-order) will yield values out of order. This seems to be the given intention of the exercise, to detect alternate structures.
The statement should be amended so as not to give the expectation that values will be listed in numeric order so that learners can simply choose any one conventional traversal algorithm to do the comparison of structure.
The text was updated successfully, but these errors were encountered: