A Tour of Go - Exercise: Equivalent Binary Trees

Exercise-Equivalent-Binary-Trees.go

package main

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

// Walk walks the tree t sending all values
// from the tree to the channel ch.
func Walk(t *tree.Tree, ch chan int) {
	WalkLoop(t, ch)
	close(ch)
}

func WalkLoop(t *tree.Tree, ch chan int) {
	if t != nil {
		WalkLoop(t.Left, ch)
		ch <- t.Value
		WalkLoop(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)

	for i := range ch1 {
		if i != <- ch2 { return false }
	}
	return true
}

func main() {
	ch := make(chan int)
	t1 := tree.New(1)
	t2 := tree.New(2)

	go Walk(t1, ch)

	fmt.Println(Same(t1, t2))
}