equivalent binary trees

equiv-binary-go-tour.go

package main

import (
	"golang.org/x/tour/tree"
	"fmt"
	"time"
	)

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

// Same determines whether the trees
// t1 and t2 contain the same values.
func Same(t1, t2 *tree.Tree) bool{
	ch1 := make(chan int, 10)
	ch2 := make(chan int, 10)
	count := 1
	go Walk(t1, ch1)
	go Walk(t2, ch2)
	for x := range ch1 {
		y := <-ch2
		fmt.Printf("%d %d \n", x, y)
		if x != y {
			return false
		}
		if count == 10 {
			break
		}
		count++
	}
	return true
}

func main() {
	start := time.Now()
	fmt.Printf("%v\n", Same(tree.New(1), tree.New(1)))
	fmt.Printf("%v\n", Same(tree.New(2), tree.New(2)))
	fmt.Printf("%s", time.Since(start))
}