golang tour exercise 68

needless.go

package main

import (
	"fmt"
	"sort"
	"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) {
	var inner func(*tree.Tree, chan int)
	inner = func(t *tree.Tree, ch chan int) {
		if t == nil {
			return
		}
		ch <- t.Value
		inner(t.Left, ch)
		inner(t.Right, ch)
	}
	inner(t, ch)
	close(ch)
}

func collect(t *tree.Tree) []int {
	c := make(chan int)
	var vals []int
	go Walk(t, c)
	for val := range c {
		vals = append(vals, val)
	}
	return vals
}

// Same determines whether the trees
// t1 and t2 contain the same values.
func Same(t1, t2 *tree.Tree) bool {
	val1 := collect(t1)
	val2 := collect(t2)
	if len(val1) != len(val2) {
		return false
	}
	sort.Ints(val1)
	sort.Ints(val2)
	for i := range val1 {
		if val1[i] != val2[i] { return false }
	}
	return true
}

func main() {
	fmt.Println(Same(tree.New(1), tree.New(1)))
	fmt.Println(Same(tree.New(1), tree.New(2)))
}