【GoLang笔记】A Tour of Go - Exercise: Equivalent Binary Trees

最新推荐文章于 2023-07-13 09:23:32 发布

原创最新推荐文章于 2023-07-13 09:23:32 发布 · 2k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#GoLang

GoLang 专栏收录该内容

6 篇文章

订阅专栏

本文介绍了一道GoLang学习教程中的练习题，主要内容包括实现二叉树的遍历函数并比较两棵树是否包含相同的值。通过具体示例展示了如何使用GoLang进行二叉树的操作。

本文是GoLang学习教程中的一道习题，具体题目要求及代码实现如下。

备注：由于天朝GFW屏蔽了GAE，所以GoLang官网及学习教程需要翻墙才能访问。

Exercise: Equivalent Binary Trees
1. Implement the Walk function.
2. Test the Walk function.

The function tree.New(k) constructs a randomly-structured binary tree holding the values k,2k, 3k, ..., 10k.

Create a new channel ch and kick off the walker:

go Walk(tree.New(1), ch)

Then read and print 10 values from the channel. It should be the numbers 1, 2, 3, ..., 10.

3. Implement the Same function using Walk to determine whether t1 and t2 store the same values.

4. Test the Same function.

Same(tree.New(1), tree.New(1)) should return true, and Same(tree.New(1), tree.New(2))should return false.

一种实现如下（深度优先中序遍历）：

package main

import "code.google.com/p/go-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) {
	//fmt.Println("tree=", t)
	left := t.Left
	right := t.Right
	if (left == nil) && (right == nil) {
		//fmt.Println("child=", t.Value)
	    ch <- t.Value
		return
	}
	
	if left != nil {
	    Walk(left, ch)
	}

	if (left != nil) || (right != nil) {
	    //fmt.Println("parent=", t.Value)
	    ch <- t.Value
	}
	
	if right != nil {
	    Walk(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)
	ch2 := make(chan int)
	go Walk(t1, ch1)
	go Walk(t2, ch2)
	
	depth := 10
	for i := 0; i < depth; i++ {
		x1 := <- ch1
		x2 := <- ch2
		if x1 != x2 {
		    return false
		}
	}
    
	return true
}

func main() {
/*
	ch1 := make(chan int)
	ch2 := make(chan int)
	go Walk(tree.New(1), ch1)
	go Walk(tree.New(2), ch2)
	
	for i := 0; i < 10; i++ {
	    fmt.Println(<-ch1)
	}
	for i := 0; i < 10; i++ {
	    fmt.Println(<-ch2)
	}
*/	
	fmt.Println(Same(tree.New(1), tree.New(2)))
}

===================== EOF ===================