|author||Alberto Donizetti <firstname.lastname@example.org>||Wed Aug 16 17:27:33 2017 +0200|
|committer||Andrew Bonventre <email@example.com>||Wed Oct 04 16:49:45 2017 +0000|
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 <firstname.lastname@example.org> Reviewed-by: Rob Phoenix <email@example.com>
A Tour of Go is an introduction to the Go programming language.
The easiest way to install the tour locally is to install a binary release of Go and then run:
$ go tool tour
To install the tour from source, first set up a workspace and then run:
$ go get golang.org/x/tour/gotour
This will place a
gotour binary in your workspace's
Unless otherwise noted, the go-tour source files are distributed under the BSD-style license found in the LICENSE file.
Contributions should follow the same procedure as for the Go project: http://golang.org/doc/contribute.html