A Tour of Go Exercise: 69 Equivalent Binary Trees

如其广告所言，Go用于写Equivalent Binary Trees确实简便优雅

package main

import "tour/tree"
import "fmt"

// 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 == nil {
        return
    }
    Walk(t.Left, ch)
    ch <- t.Value
    Walk(t.Right, ch)

}

// Same determines whether the trees
// t1 and t2 contain the same values.
func Same(t1, t2 *tree.Tree) bool{
    cht1 := make (chan int, 10)
    cht2 := make (chan int, 10)
    go Walk(t1, cht1)
    go Walk(t2, cht2)
    for i := 0; i < 10; i++{
        if <-cht1 != <-cht2{
            return false
        }
    }
    return true
}

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