tree

Documentation

Index

• func Dfs(node *TreeNode, l int, r int) int
• type TreeNode
  • func Bfs(nodes []*TreeNode) ([]int, []*TreeNode)
  • func (t *TreeNode) Add(arr []int, i int) int
  • func (t *TreeNode) Diagram(top string, root string, bottom string) string
  • func (t *TreeNode) List() []int
  • func (t *TreeNode) Size() int

Functions

func Dfs

func Dfs(node *TreeNode, l int, r int) int

Dfs is an algorithm for traversing or searching tree or graph data structures.

Types

type TreeNode

type TreeNode struct {
	Val   int
	Left  *TreeNode
	Right *TreeNode
}

func Bfs

func Bfs(nodes []*TreeNode) ([]int, []*TreeNode)

Bfs Breadth-First Search

func (*TreeNode) Add

func (t *TreeNode) Add(arr []int, i int) int

func (*TreeNode) Diagram

func (t *TreeNode) Diagram(top string, root string, bottom string) string

func (*TreeNode) List

func (t *TreeNode) List() []int

func (*TreeNode) Size

func (t *TreeNode) Size() int