sm/gotour-notes
1
0
Fork 0
Code

implemented Same

Browse Source
This commit is contained in:
Stephen M. McQuay 2012-09-03 21:27:24 -06:00
parent 916def1c5e
commit 0566ee594f
1 changed files with 15 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
exercises/08-ebt/go.go
View File

@ -12,7 +12,7 @@ func Walk(t *tree.Tree, ch chan int) {
// that I can use the range-based forloop in main.main
var walk func(t *tree.Tree)
walk = func(t *tree.Tree) {
if t == nil {
if t != nil {
walk(t.Left)
ch <- t.Value
walk(t.Right)
@ -24,15 +24,27 @@ func Walk(t *tree.Tree, ch chan int) {
// Same determines whether the trees
// t1 and t2 contain the same values.
func Same(t1, t2 *tree.Tree) bool
func Same(t1, t2 *tree.Tree) bool {
ch1 := make(chan int)
ch2 := make(chan int)
go Walk(t1, ch1)
go Walk(t2, ch2)
for i := range ch1 {
if i != <-ch2 {
return false
}
}
return true
}
func main() {
t := tree.New(1)
ch := make(chan int)
go Walk(t, ch)
fmt.Printf("%v\n", t)
for i := range ch {
fmt.Printf("%d, ", i)
}
fmt.Println()
fmt.Println(Same(tree.New(1), tree.New(1)))
fmt.Println(Same(tree.New(1), tree.New(2)))
}