Exercise: Equivalent Binary Trees

package main

import "golang.org/x/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) {
    var traverse func(t *tree.Tree)
    traverse = func(t *tree.Tree) {
        if t == nil {
            return
        }
        traverse(t.Left)
        ch <- t.Value
        traverse(t.Right)
    }
    traverse(t)
    close(ch)
}

// Same determines whether the trees
// t1 and t2 contain the same values.
func Same(t1, t2 *tree.Tree) bool {
    ch_1, ch_2 := make(chan int), make(chan int)
    go Walk(t1, ch_1)
    go Walk(t2, ch_2)
    for first := range ch_1 {
        select {
        case second := <-ch_2:
            if first != second {
                return false
            }
        default:
            break
        }

        /*      second := <-ch_2
                if first != second {
                    return false
                }*/
    }
    /*  if _, ok := <-ch_2; ok {
        return false
    }*/
    return true
}

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

    t1 := tree.New(2)
    t2 := tree.New(3)
    fmt.Println(t1)
    fmt.Println(t2)
    fmt.Println(Same(t1, t2))
}