content: clarify that tree.New returns sorted trees
The description of the 'Equivalent Binary Trees' exercise says:
The function tree.New constructs a randomly-structured binary tree
In the context of CS, 'binary trees' (in the 'data structure' sense)
are sorted by definition, but sometimes the term is used, expecially
in mathematics, to indicate the more general notion of a tree with at
most two children.
Since it has been reported that tour users are sometimes confused by
this (see the linked issue), clarify that the tree.New function
returns random, but *always sorted* trees.
Fixes golang/tour#270
Change-Id: Ibfca0e2a8e947a839545433d1da0f4621ea65340
Reviewed-on: https://go-review.googlesource.com/56171
Reviewed-by: Andrew Bonventre <andybons@golang.org>
Reviewed-by: Rob Phoenix <rob@robphoenix.com>
diff --git a/content/concurrency.article b/content/concurrency.article
index 5fd0fcc..3d59db5 100644
--- a/content/concurrency.article
+++ b/content/concurrency.article
@@ -117,7 +117,7 @@
*2.* Test the `Walk` function.
-The function `tree.New(k)` constructs a randomly-structured binary tree holding the values `k`, `2k`, `3k`, ..., `10k`.
+The function `tree.New(k)` constructs a randomly-structured (but always sorted) binary tree holding the values `k`, `2k`, `3k`, ..., `10k`.
Create a new channel `ch` and kick off the walker:
