binarytree

Documentation

Index

• type Node
  • func (n *Node[T]) Height() int
  • func (n *Node[T]) Left() *Node[T]
  • func (n *Node[T]) Parent() *Node[T]
  • func (n *Node[T]) Right() *Node[T]
  • func (n *Node[T]) Size() int
  • func (n *Node[T]) Value() T
• type Tree
  • func New[T constraints.Ordered]() Tree[T]
  • func (t *Tree[T]) Height() int
  • func (t *Tree[T]) Insert(val T)
  • func (t *Tree[T]) Root() *Node[T]
  • func (t *Tree[T]) Size() int

Types

type Node

type Node[T constraints.Ordered] struct {
	// contains filtered or unexported fields
}

func (*Node[T]) Height

func (n *Node[T]) Height() int

func (*Node[T]) Left

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

func (*Node[T]) Parent

func (n *Node[T]) Parent() *Node[T]

func (*Node[T]) Right

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

func (*Node[T]) Size

func (n *Node[T]) Size() int

func (*Node[T]) Value

func (n *Node[T]) Value() T

type Tree

type Tree[T constraints.Ordered] struct {
	// contains filtered or unexported fields
}

func New

func New[T constraints.Ordered]() Tree[T]

func (*Tree[T]) Height

func (t *Tree[T]) Height() int

func (*Tree[T]) Insert

func (t *Tree[T]) Insert(val T)

func (*Tree[T]) Root

func (t *Tree[T]) Root() *Node[T]

func (*Tree[T]) Size

func (t *Tree[T]) Size() int