equivalent binary tree

exercise10.go

package main

import (
    "code.google.com/p/go-tour/tree"
    "fmt"
)
func Walk(t *tree.Tree, ch chan int) {
	_Walk(t, ch)
    close(ch)
}
// 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, ch2 := make(chan int), make(chan int)
    
    go Walk(t1, ch1)
    go Walk(t2, ch2)
    
    for i := range ch1 {
        if i != <- ch2 {
            return false
        }
    }
    return true
}

func main() {
	fmt.Println(Same(tree.New(1), tree.New(1)))
	fmt.Println(Same(tree.New(1), tree.New(2)))
}