go 判断两棵树内容是否一致

goroutine

http://127.0.0.1:3999/concurrency/8

question

使用 go 判断两个树存放的序列是否相同, 如果相同他们被称为 equivalent_tree

tree struct


type Tree struct {Left  *TreeValue intRight *Tree
}

由于递归的写法比较简单, 此处使用循环的形式来实现.
因为循环的写法不存在调用栈的瓶颈, 所以在实际工程中, 能够避免递归还是避免递归吧.
judge tree

package mainimport "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) {_ts := make(chan *tree.Tree, 100)_ts <- t
OuterLoop:for {_f1 := func(_tmp *tree.Tree) {fmt.Println(_tmp.Value)ch <- _tmp.Valuefor _, v := range []*tree.Tree{_tmp.Left, _tmp.Right} {if v != nil {_ts <- v}}}select {case _tmp := <-_ts:_f1(_tmp)default:fmt.Println("break")break OuterLoop}}
}// Same determines whether the trees
// t1 and t2 contain the same values.
func Same(t1, t2 *tree.Tree) bool {return true
}func main() {_t1 := tree.New(1)_c1 := make(chan int, 100)Walk(_t1, _c1)_t2 := tree.New(1)_c2 := make(chan int, 100)Walk(_t2, _c2)fmt.Println(_c)
}