Exercise: Equivalent Binary Trees

walk.go

https://go.dev/tour/concurrency/8
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){
	_walk(t,ch)
	close(ch)

}
func _walk(t *tree.Tree, ch chan int){
	if t!=nil {
		_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{
	ch1:=make(chan int)
	go Walk(t1, ch1)
	ch2:=make(chan int)
	go Walk(t2, ch2)
		for i := 0; i < 10; i++ {
			if <-ch1 !=<-ch2{
			  return false
			}
			
		}
return true
}

func main() {
	ch:=make(chan int, 10)
	go Walk(tree.New(1), ch)
			for i := 0; i < 10; i++ {

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


}