詳解Go語(yǔ)言如何實(shí)現(xiàn)二叉樹(shù)遍歷

更新時(shí)間：2022年04月19日 16:49:39 作者：隱姓埋名4869

這篇文章主要為大家詳解介紹了Go語(yǔ)言中如何實(shí)現(xiàn)二叉樹(shù)遍歷，文中的示例代碼講解詳細(xì)，對(duì)我們學(xué)習(xí)Go語(yǔ)言有一定幫助，需要的可以參考一下

1. 二叉樹(shù)的定義

二叉樹(shù)需滿足的條件

① 本身是有序樹(shù)

② 樹(shù)中包含的各個(gè)節(jié)點(diǎn)的長(zhǎng)度不能超過(guò)2，即只能是0、1或者2

2. 前序遍歷

前序遍歷二叉樹(shù)的順序：根——》左——》右

package main

import "fmt"

//定義結(jié)構(gòu)體
type Student struct {
	Name  string
	Age   int
	Score float32
	left  *Student //左子樹(shù)指針
	right *Student //右子樹(shù)指針
}

//二叉樹(shù)定義
func main() {
	//根節(jié)點(diǎn)
	var root Student
	root.Name = "root"
	root.Age = 18
	root.Score = 88

	//一級(jí)左子樹(shù)
	var left1 Student
	left1.Name = "left1"
	left1.Age = 20
	left1.Score = 80

	root.left = &left1

	//一級(jí)右子樹(shù)
	var right1 Student
	right1.Name = "right1"
	right1.Age = 22
	right1.Score = 100

	root.right = &right1

	//二級(jí)左子樹(shù)
	var left2 Student
	left2.Name = "left2"
	left2.Age = 25
	left2.Score = 90

	left1.left = &left2

	//調(diào)用遍歷函數(shù)
	Req(&root)

}

//遞歸算法遍歷整個(gè)二叉樹(shù)
func Req(tmp *Student) {
	for tmp == nil {
		return
	}
	fmt.Println(tmp)
	//遍歷左子樹(shù)
	Req(tmp.left)
	//遍歷右子樹(shù)
	Req(tmp.right)
}

輸出結(jié)果如下

&{root 18 88 0xc0000c0480 0xc0000c04b0}
&{left1 20 80 0xc0000c04e0 <nil>}
&{left2 25 90 <nil> <nil>}
&{right1 22 100 <nil> <nil>}

3. 中序遍歷

中序遍歷：左——》根——》右

package main

import "fmt"

//定義結(jié)構(gòu)體
type Student struct {
	Name  string
	Age   int
	Score float32
	left  *Student //左子樹(shù)指針
	right *Student //右子樹(shù)指針
}

//二叉樹(shù)定義
func main() {
	//根節(jié)點(diǎn)
	var root Student
	root.Name = "root"
	root.Age = 18
	root.Score = 88

	//一級(jí)左子樹(shù)
	var left1 Student
	left1.Name = "left1"
	left1.Age = 20
	left1.Score = 80

	root.left = &left1

	//一級(jí)右子樹(shù)
	var right1 Student
	right1.Name = "right1"
	right1.Age = 22
	right1.Score = 100

	root.right = &right1

	//二級(jí)左子樹(shù)
	var left2 Student
	left2.Name = "left2"
	left2.Age = 25
	left2.Score = 90

	left1.left = &left2

	//調(diào)用遍歷函數(shù)
	Req(&root)

}

//遞歸算法遍歷整個(gè)二叉樹(shù)
func Req(tmp *Student) {
	for tmp == nil {
		return
	}

	//遍歷左子樹(shù)
	Req(tmp.left)

	//輸出root節(jié)點(diǎn)
	fmt.Println(tmp)

	//遍歷右子樹(shù)
	Req(tmp.right)
}

輸出結(jié)果如下

&{left2 25 90 <nil> <nil>}
&{left1 20 80 0xc000114510 <nil>}
&{root 18 88 0xc0001144b0 0xc0001144e0}
&{right1 22 100 <nil> <nil>}

4. 后序遍歷

后序遍歷：左——》右——》根

package main

import "fmt"

//定義結(jié)構(gòu)體
type Student struct {
	Name  string
	Age   int
	Score float32
	left  *Student //左子樹(shù)指針
	right *Student //右子樹(shù)指針
}

//二叉樹(shù)定義
func main() {
	//根節(jié)點(diǎn)
	var root Student
	root.Name = "root"
	root.Age = 18
	root.Score = 88

	//一級(jí)左子樹(shù)
	var left1 Student
	left1.Name = "left1"
	left1.Age = 20
	left1.Score = 80

	root.left = &left1

	//一級(jí)右子樹(shù)
	var right1 Student
	right1.Name = "right1"
	right1.Age = 22
	right1.Score = 100

	root.right = &right1

	//二級(jí)左子樹(shù)
	var left2 Student
	left2.Name = "left2"
	left2.Age = 25
	left2.Score = 90

	left1.left = &left2

	//調(diào)用遍歷函數(shù)
	Req(&root)

}

//遞歸算法遍歷整個(gè)二叉樹(shù)
func Req(tmp *Student) {
	for tmp == nil {
		return
	}

	//遍歷左子樹(shù)
	Req(tmp.left)

	//遍歷右子樹(shù)
	Req(tmp.right)

	//輸出root節(jié)點(diǎn)
	fmt.Println(tmp)

}

輸出結(jié)果如下