Exercise: Equivalent Binary Trees https://tour.golang.org/concurrency/8

EquivalentBinaryTrees.go

package main

import "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) {
	if t.Left != nil {
		Walk(t.Left, ch)
	}
	ch <- t.Value
	if t.Right != nil {
		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)
	ch2 := make(chan int)
	go Walk(t1, ch1)
	go Walk(t2, ch2)

	iTotal, jTotal := 0, 0
	for index := 1; index <= 20; index++ {		
        select {
			case i := <-ch1:
            {
                //println(i)
				iTotal += i
            }
			case j := <- ch2:
			{
				//println(j)
				jTotal += j
			}
        }		
    }
	return iTotal == jTotal
}

func main() {
	print(Same(tree.New(2), tree.New(2)))
}