tour: btrees do not store values just in leaves
The concurrency/7 slide (the binary tree exercise) says:
> There can be many different binary trees with the same sequence of
values stored at the leaves.
Which is misleading: in the btree in the exercise, values are not
stored just in the leaves, the internal nodes hold values too.
Fixes golang/tour#774
Change-Id: I71af71ccf36ac8ad87dfe73b751b461890c3a7e0
Reviewed-on: https://go-review.googlesource.com/c/tour/+/179937
Reviewed-by: Andrew Bonventre <andybons@golang.org>
diff --git a/content/concurrency.article b/content/concurrency.article
index b6bd509..35945b0 100644
--- a/content/concurrency.article
+++ b/content/concurrency.article
@@ -94,7 +94,7 @@
* Exercise: Equivalent Binary Trees
-There can be many different binary trees with the same sequence of values stored at the leaves. For example, here are two binary trees storing the sequence 1, 1, 2, 3, 5, 8, 13.
+There can be many different binary trees with the same sequence of values stored in it. For example, here are two binary trees storing the sequence 1, 1, 2, 3, 5, 8, 13.
.image /content/img/tree.png
