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) {
	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, 10)
	ch2 := make(chan int, 10)
	go Walk(t1, ch1)
	go Walk(t2, ch2)
	
	items1 := make([]int, 0)
	items2 := make([]int, 0)
	
	for i := 0; i < cap(ch1); i++ {
		items1 = append(items1, <-ch1)
	}
	
	for j := 0; j < cap(ch2); j++ {
		items2 = append(items2, <-ch2)
	}
	
	for idx, item := range items1 {
    
		if item != items2[idx] {
			return false
		}
	}
	
	return true
}

func main() {
	fmt.Printf("Same(tree.New(1), tree.New(1) = %t \n", Same(tree.New(1), tree.New(1)))
	fmt.Printf("Same(tree.New(1), tree.New(2) = %t \n", Same(tree.New(1), tree.New(2)))
}