https://tour.golang.org/concurrency/8

exercise-equivalent-binary-trees.go

package main

import (
	"fmt"
	"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) {
	Recurse(t, ch)
	close(ch)
}

func Recurse(t *tree.Tree, ch chan int) {
	if t != nil {
		Recurse(t.Left, ch)
		ch <- t.Value
		Recurse(t.Right, ch)
	}
}

// Same determines whether the trees
// t1 and t2 contain the same values.
func Same(t1, t2 *tree.Tree) bool {
	v1 := make(chan int)
	v2 := make(chan int)
	
	go Walk(t1, v1)
	go Walk(t2, v2)
	
	for val := range v1 {
		if val != <-v2 {
			return false
		}
	}
	
	return true
}

func Show(ch chan int) {
	for v := range ch {
		fmt.Println(v)
	}	
}

func main() {
	ch := make(chan int)
	go Walk(tree.New(1), ch)
	Show(ch)
	
	fmt.Println(Same(tree.New(1), tree.New(1)))
	fmt.Println(Same(tree.New(1), tree.New(2)))
}

Would Same() return the wrong answer if given a tree ((1) 2 (0)) and another tree ((1) 2) because a closed channel will return zero value for the channel type?