binaryTree

Documentation

Index

• func InOrder(root *Node) []int
• func LevelOrder(root *Node) [][]int
• func Morris(root *Node)
• func PostOrder(root *Node) []int
• func PreDfs(root *Node) []int
• func PreDivide(root *Node) []int
• func PreOrder(root *Node) []int
• type Node

Functions

func InOrder

func InOrder(root *Node) []int

func LevelOrder

func LevelOrder(root *Node) [][]int

func Morris

func Morris(root *Node)

Morris 空间复杂下降到1

func PostOrder

func PostOrder(root *Node) []int

深度搜索，从下到上，分治 左右中

func PreDfs

func PreDfs(root *Node) []int

深度搜索从上到下

func PreDivide

func PreDivide(root *Node) []int

深度搜索，从下到上

func PreOrder

func PreOrder(root *Node) []int

print proOrder num

Types

type Node

type Node struct {
	Left, Right *Node
	Val         int
}