A Tour of Go - Equivalent Binary Tree

main.go

package main

import "code.google.com/p/go-tour/tree"
import "fmt"

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

}

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

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

func main() {
    ch := make(chan int)
    
    go Walk(tree.New(5), ch)
    
    for s := range ch {
    	fmt.Println(s)
    }
    
    same := Same(tree.New(1), tree.New(1))
    fmt.Println(same)
    
    same = Same(tree.New(1), tree.New(2))
    fmt.Println(same)
}