Golang code-google-com-p-go-tour-tree.New模块，常用函数和类-面圈网

作者：yutakakinjy 项目：go-lear

func main() {
	if Same(tree.New(1), tree.New(1)) {
		fmt.Println("Same!")
	} else {
		fmt.Println("not Same!")
	}
}

作者：kgaugha 项目：learnin

func main() {
	if Same(tree.New(1), tree.New(2)) {
		fmt.Println("Yay!")
	} else {
		fmt.Println("Nay!")
	}
}

作者：simbapee 项目：stud

func main() {
	t1 := tree.New(1)
	t2 := tree.New(1)

	fmt.Println(Same(t1, t2))

}

作者：py0 项目：a_tour_of_g

// C70 ...
func C70(opts Options, args []string) int {
	t1 := tree.New(1)
	t2 := tree.New(1)
	fmt.Println(t1)
	fmt.Println(t2)
	fmt.Println(same(t1, t2))
	return 0
}

作者：jable 项目：gotou

func main() {
	//    ch := make(chan int)
	//    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)))
}

作者：heydabo 项目：go-tou

func main() {
	ch := make(chan int)
	go Walk(tree.New(1), ch)
	for i := range ch {
		fmt.Println(i)
	}
	fmt.Println(Same(tree.New(1), tree.New(1)))
	fmt.Println(Same(tree.New(1), tree.New(2)))
}

作者：rangili 项目：go-tour-exercise

func TestSame(t *testing.T) {
	if !Same(tree.New(1), tree.New(1)) {
		t.Errorf("Expect tree.New(1) is the same with tree.New(1)")
	}

	if Same(tree.New(1), tree.New(2)) {
		t.Errorf("Expect tree.New(1) is not the same with tree.New(2)")
	}
}

作者：rhcarvalh 项目：gotour-solution

func main() {
	ch := make(chan int)
	go Walk(tree.New(1), ch)
	for i := 0; i < 10; i++ {
		print(<-ch, " ")
	}
	print("\n")
	println(Same(tree.New(1), tree.New(1)),
		Same(tree.New(2), tree.New(1)))
}

作者：EmperorEart 项目：learnG

func main() {
	ch := make(chan int)
	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)))
}

作者：takyam-gi 项目：tour-of-g

func main() {
	if !Same(tree.New(1), tree.New(1)) {
		fmt.Println("fail!! 1 && 1")
		return
	}
	if Same(tree.New(1), tree.New(2)) {
		fmt.Println("fail!! 1 && 2")
		return
	}
	fmt.Println("all succeed!")
}

作者：raydiv 项目：tour_of_g

func main() {
	ch := make(chan int)
	go Walk(tree.New(1), ch)
	for n := range ch {
		print(n, " ")
	}
	println()

	println(Same(tree.New(1), tree.New(1)))
	println(Same(tree.New(1), tree.New(2)))
}

作者：schettino7 项目：gotou

func main() {
	t1 := tree.New(1)
	/*
	   ch := make(chan int, 10)
	   go Walk(t1, ch)
	   for val := range(ch){
	       fmt.Println(val)
	   }
	*/
	fmt.Println(Same(t1, tree.New(1)))
	fmt.Println(Same(t1, tree.New(2)))
}

作者：jchjj 项目：learnG

func main() {
	t := tree.New(1)
	t2 := tree.New(1)
	fmt.Println(t)
	fmt.Println(t2)
	c := make(chan int)
	go Walk(t, c)
	for i := 0; i < 10; i++ {
		fmt.Println(<-c)
	}
	fmt.Println(Same(t, t2))
}

作者：xingyul 项目：godem

func page68_Exercise_EquivalentBinaryTrees() {
	// test Walk
	/*
		ch := make(chan int)
		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)))
}

作者：jlubaw 项目：gotou

func Exercise11() {
	// Uncomment to test Walk

	// ch := make(chan int)
	// go Walk(tree.New(1), ch)
	//
	// for v := range ch {
	// 	fmt.Printf("%d\n", v)
	// }

	fmt.Printf("tree.New(1) == tree.New(1) is %t\n", Same(tree.New(1), tree.New(1)))
	fmt.Printf("tree.New(1) == tree.New(2) is %t\n", Same(tree.New(1), tree.New(2)))
}

作者：rangili 项目：go-tour-exercise

func main() {
	ch := make(chan int)

	// test Walk
	go Walk(tree.New(1), ch)
	for n := range ch {
		fmt.Print(n)
	}
	fmt.Println()

	// test Same
	fmt.Println(Same(tree.New(1), tree.New(1))) // should be true
	fmt.Println(Same(tree.New(1), tree.New(2))) // should be false
}

作者：mockturt 项目：get-goin

func main() {
	rand.Seed(time.Now().UTC().UnixNano())
	t1, t2 := tree.New(1), tree.New(2)

	log.Println("t1: ", t1)
	//dump(t1)

	log.Println("t2: ", t2)
	//dump(t2)

	log.Println("t1 == t1? ", Same(t1, t1, 1))
	log.Println("t2 == t2? ", Same(t2, t2, 1))
	log.Println("t1 == t2? ", Same(t1, t2, 2))
}

作者：yuta-masan 项目：a_tour_of_g

func main() {
	ch := make(chan int)
	t1 := tree.New(1)
	t2 := tree.New(2)

	// fmt.Println(PyutaWalk(t1))
	// foreachNode(t1)

	go Walk(t1, ch)
	for c := range ch {
		fmt.Println(c)
	}
	fmt.Printf("%v\n", Same(t1, t2))
}

作者：roc 项目：G

func main() {

	t1 := tree.Tree{
		&tree.Tree{
			&tree.Tree{
				nil,
				1,
				nil,
			},
			1,
			&tree.Tree{
				nil,
				2,
				nil,
			},
		},
		3,
		&tree.Tree{
			&tree.Tree{
				nil,
				5,
				nil,
			},
			8,
			&tree.Tree{
				nil,
				13,
				nil,
			},
		},
	}
	t2 := tree.Tree{
		&tree.Tree{
			&tree.Tree{
				&tree.Tree{nil, 1, nil},
				1,
				&tree.Tree{nil, 2, nil},
			},
			3,
			&tree.Tree{nil, 5, nil},
		},
		8,
		&tree.Tree{nil, 13, nil},
	}

	fmt.Println("Are they the same ?", Same(&t1, &t2))
	fmt.Println("Are they the same ?", Same(tree.New(1), tree.New(1)))
	fmt.Println("Are they the same ?", Same(tree.New(1), tree.New(2)))
}

作者：doublek42 项目：go-tou

func main() {
	fmt.Print("tree.New(1) == tree.New(1): ")
	if Same(tree.New(1), tree.New(1)) {
		fmt.Println("PASSED")
	} else {
		fmt.Println("FAILED")
	}

	fmt.Print("tree.New(1) != tree.New(2): ")
	if !Same(tree.New(1), tree.New(2)) {
		fmt.Println("PASSED")
	} else {
		fmt.Println("FAILED")
	}
}

Golang code-google-com-p-go-tour-tree.New类(方法)实例源码