A tour of Go

concurrency-8.go

package main

import (
	"fmt"
	"sort"

	"golang.org/x/tour/tree"
)

// Walk walks the tree t sending all values
// from the tree to the channel ch.
func Walk(t *tree.Tree, ch chan int) {
	ch <- t.Value
	if t.Left != nil {
		Walk(t.Left, ch)
	}
	if t.Right != nil {
		Walk(t.Right, ch)
	}
	//close(ch)
}

func toSlice(t *tree.Tree) []int {
	ch := make(chan int, 10)
	go Walk(t, ch)
	var ns []int
	for i := 0; i < 10; i++ {
		ns = append(ns, <-ch)
	}
	sort.Ints(ns)
	return ns
}

// Same determines whether the trees
// t1 and t2 contain the same values.
func Same(t1, t2 *tree.Tree) bool {
	xs := toSlice(t1)
	ys := toSlice(t2)
	for i := 0; i < 10; i++ {
		if xs[i] != ys[i] {
			return false
		}
	}
	return true
}

func main() {
	ch := make(chan int, 10)
	go Walk(tree.New(1), ch)
	for i := 0; i < 10; i++ {
		fmt.Print(<-ch)
		fmt.Print(" ")
	}
	fmt.Println("")
	fmt.Println(Same(tree.New(1), tree.New(1)))
	fmt.Println(Same(tree.New(1), tree.New(2)))
}