Equivalent Binary Trees Exercise from Golang Tour

golang_tour_72.go

package main

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

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

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

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

func main() {

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

Still missing a way to signal when both trees were entirely "walked" @ line 33