| commit | 6c971933859436f7b3f967d112fe8422deb12d41 | [log] [tgz] |
|---|---|---|
| author | Alberto Donizetti <alb.donizetti@gmail.com> | Wed Aug 16 17:27:33 2017 +0200 |
| committer | Andrew Bonventre <andybons@golang.org> | Wed Oct 04 16:49:45 2017 +0000 |
| tree | 9f6fed0cd98b26627a8ca221d1ea70a92ba5662a | |
| parent | b98e5214fcd853db116b90dcd791ec2f9c947885 [diff] |
[x/tour] 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> X-Tour-Commit: 279fc850d72ee755bf08339069eb9ebdf23a0620
This repository holds the Go Website server code and content.
The easiest way to install is to run go get -u golang.org/x/website. You can also manually git clone the repository to $GOPATH/src/golang.org/x/website.
This repository uses Gerrit for code changes. To learn how to submit changes to this repository, see https://golang.org/doc/contribute.html.
The main issue tracker for the time repository is located at https://github.com/golang/go/issues. Prefix your issue with “x/website:” in the subject line, so it is easy to find.