bst

Documentation

Index

• Constants
• func Traversal[K cmp.Ordered, T any](order traversalOrder, node *Node[K, T], callback func(node *Node[K, T]))
• type Node
  • func Insert[K cmp.Ordered, T any](src, dst *Node[K, T]) *Node[K, T]
  • func New[K cmp.Ordered, T any](key K, data T) *Node[K, T]
  • func Search[K cmp.Ordered, T any](src, dst *Node[K, T]) *Node[K, T]
  • func (n *Node[K, T]) Data() T
  • func (n *Node[K, T]) Key() K
  • func (n *Node[K, T]) Left() *Node[K, T]
  • func (n *Node[K, T]) Right() *Node[K, T]
  • func (n *Node[K, T]) String() string

Constants

const (
	PREORDER traversalOrder = iota
	INORDER
	POSTORDER
	BFS
	DFS
)

Functions

func Traversal

func Traversal[K cmp.Ordered, T any](order traversalOrder, node *Node[K, T], callback func(node *Node[K, T]))

Types

type Node

type Node[K cmp.Ordered, T any] struct {
	// contains filtered or unexported fields
}

func Insert

func Insert[K cmp.Ordered, T any](src, dst *Node[K, T]) *Node[K, T]

func New

func New[K cmp.Ordered, T any](key K, data T) *Node[K, T]

func Search

func Search[K cmp.Ordered, T any](src, dst *Node[K, T]) *Node[K, T]

func (*Node[K, T]) Data

func (n *Node[K, T]) Data() T

func (*Node[K, T]) Key

func (n *Node[K, T]) Key() K

func (*Node[K, T]) Left

func (n *Node[K, T]) Left() *Node[K, T]

func (*Node[K, T]) Right

func (n *Node[K, T]) Right() *Node[K, T]

func (*Node[K, T]) String

func (n *Node[K, T]) String() string