tree

Documentation

Index

• func InOrder[T any](n TreeNodeI[T], rlt *[]T)
• func ParseFunc[T any]() func(val string) (T, error)
• func PostOrder[T any](n TreeNodeI[T], rlt *[]T)
• func PreOrder[T any](n TreeNodeI[T], rlt *[]T)
• func TreeBFS[T any](root TreeNodeI[T]) [][]T
• type SearchTree
  • func (r *SearchTree[T]) Del(data T)
  • func (r *SearchTree[T]) Find(data T) *TreeNode[T]
  • func (r *SearchTree[T]) Put(data T)
• type TreeNode
  • func NewTree[T any](level ...[]string) *TreeNode[T]
  • func (t *TreeNode[T]) Left() TreeNodeI[T]
  • func (t *TreeNode[T]) Right() TreeNodeI[T]
  • func (t *TreeNode[T]) Val() T
• type TreeNodeI

Functions

func InOrder

func InOrder[T any](n TreeNodeI[T], rlt *[]T)

func ParseFunc

func ParseFunc[T any]() func(val string) (T, error)

func PostOrder

func PostOrder[T any](n TreeNodeI[T], rlt *[]T)

func PreOrder

func PreOrder[T any](n TreeNodeI[T], rlt *[]T)

func TreeBFS

func TreeBFS[T any](root TreeNodeI[T]) [][]T

Types

type SearchTree

type SearchTree[T xcontainer.Orderliness] struct {
	// contains filtered or unexported fields
}

func (*SearchTree[T]) Del

func (r *SearchTree[T]) Del(data T)

func (*SearchTree[T]) Find

func (r *SearchTree[T]) Find(data T) *TreeNode[T]

func (*SearchTree[T]) Put

func (r *SearchTree[T]) Put(data T)

type TreeNode

type TreeNode[T any] struct {
	// contains filtered or unexported fields
}

func NewTree

func NewTree[T any](level ...[]string) *TreeNode[T]

func (*TreeNode[T]) Left

func (t *TreeNode[T]) Left() TreeNodeI[T]

func (*TreeNode[T]) Right

func (t *TreeNode[T]) Right() TreeNodeI[T]

func (*TreeNode[T]) Val

func (t *TreeNode[T]) Val() T

type TreeNodeI

type TreeNodeI[T any] interface {
	Val() T
	Left() TreeNodeI[T]
	Right() TreeNodeI[T]
}