binarytree

package
v0.0.0-...-5cc1d31 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Jul 21, 2022 License: MIT Imports: 0 Imported by: 0

Documentation

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type TreeNode

type TreeNode struct {
	Value  int
	Height int
	Left   *TreeNode
	Right  *TreeNode
}

TreeNode 二叉树结点

func BuildTreeFromPostIn

func BuildTreeFromPostIn(postorder, inorder []int) *TreeNode

BuildTreeFromPostIn 从后序和中序构造二叉树

func BuildTreeFromPreIn

func BuildTreeFromPreIn(preorder, inorder []int) *TreeNode

BuildTreeFromPreIn 从前序和中序构造二叉树

func (*TreeNode) InOrder

func (root *TreeNode) InOrder() []int

InOrder 中序遍历

func (*TreeNode) InvertTree

func (root *TreeNode) InvertTree() *TreeNode

InvertTree 翻转二叉树

func (*TreeNode) InvertTreeRecursive

func (root *TreeNode) InvertTreeRecursive() *TreeNode

InvertTreeRecursive 翻转二叉树

func (*TreeNode) LevelOrder

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

LevelOrder 层次遍历 BFS

func (*TreeNode) LevelOrderRecursive

func (root *TreeNode) LevelOrderRecursive() [][]int

LevelOrderRecursive 层次遍历

func (*TreeNode) PostOrder

func (root *TreeNode) PostOrder() []int

PostOrder 后序遍历 前序遍历镜像 根->右->左,结果逆序 左->右->根

func (*TreeNode) PreOrder

func (root *TreeNode) PreOrder() []int

PreOrder 前序遍历 DFS

func (*TreeNode) PreOrderRecursive

func (root *TreeNode) PreOrderRecursive() []int

PreOrderRecursive 前序遍历递归

func (*TreeNode) Predecessor

func (root *TreeNode) Predecessor() *TreeNode

Predecessor 前驱

func (*TreeNode) Successor

func (root *TreeNode) Successor() *TreeNode

Successor 后继

Directories

Path Synopsis

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL