Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security
  
  How Go can help keep you secure by default
Learn
Docs
- Effective Go
  
  Tips for writing clear, performant, and idiomatic Go code
- Go User Manual
  
  A complete introduction to building software with Go
- Standard library
  
  Reference documentation for Go's standard library
- Release Notes
  
  Learn what's new in each Go release
Packages
Community
- Recorded Talks
  
  Videos from prior events
- Meetups
  
  Meet other local Go developers
- Conferences
  
  Learn and network with Go developers from around the world
- Go blog
  
  The Go project's official blog.
- Go project
  
  Get help and stay informed from Go
- Get connected

binarysearchtree

package

Go to main page

Versions in this module

v1

v1.2.0

Dec 13, 2024

Changes in this version

+ func IteratorNodeInorder[T any](node *BinarySearchTreeNode[T]) iter.Seq[T]

+ func IteratorNodePostorder[T any](node *BinarySearchTreeNode[T]) iter.Seq[T]

+ func IteratorNodePreorder[T any](node *BinarySearchTreeNode[T]) iter.Seq[T]

+ func IteratorTreeInorder[T any](tree *BinarySearchTree[T]) iter.Seq[T]

+ func IteratorTreePostorder[T any](tree *BinarySearchTree[T]) iter.Seq[T]

+ func IteratorTreePreorder[T any](tree *BinarySearchTree[T]) iter.Seq[T]

v1.1.0

Dec 12, 2024

Changes in this version

type BinarySearchTree

+ func (tree *BinarySearchTree[T]) Items() []T

v1.0.0

Dec 6, 2024

Changes in this version

+ func ApplyNodeInorder[T any](node *BinarySearchTreeNode[T], f func(item T))

+ func ApplyNodePostorder[T any](node *BinarySearchTreeNode[T], f func(item T))

+ func ApplyNodePreorder[T any](node *BinarySearchTreeNode[T], f func(item T))

+ func ApplyTreeInorder[T any](tree *BinarySearchTree[T], f func(item T))

+ func ApplyTreePostorder[T any](tree *BinarySearchTree[T], f func(item T))

+ func ApplyTreePreorder[T any](tree *BinarySearchTree[T], f func(item T))

+ func FoldNodeInorder[T, G any](node *BinarySearchTreeNode[T], initialAccumulator G, ...) G

+ func FoldNodePostorder[T, G any](node *BinarySearchTreeNode[T], initialAccumulator G, ...) G

+ func FoldNodePreorder[T, G any](node *BinarySearchTreeNode[T], initialAccumulator G, ...) G

+ func FoldTreeInorder[T, G any](tree *BinarySearchTree[T], initialAccumulator G, ...) G

+ func FoldTreePostorder[T, G any](tree *BinarySearchTree[T], initialAccumulator G, ...) G

+ func FoldTreePreorder[T, G any](tree *BinarySearchTree[T], initialAccumulator G, ...) G

+ type BinarySearchTree struct

+ func New[T any](comparatorFunction comparator.ComparatorFunction[T]) *BinarySearchTree[T]

+ func (tree *BinarySearchTree[T]) Add(item T) error

+ func (tree *BinarySearchTree[T]) Find(item T) (*BinarySearchTreeNode[T], error)

+ func (tree *BinarySearchTree[T]) Remove(item T) error

+ func (tree *BinarySearchTree[T]) Root() *BinarySearchTreeNode[T]

+ type BinarySearchTreeNode struct

+ func (node *BinarySearchTreeNode[T]) Height() int

+ func (node *BinarySearchTreeNode[T]) Item() T

+ func (node *BinarySearchTreeNode[T]) Left() *BinarySearchTreeNode[T]

+ func (node *BinarySearchTreeNode[T]) Parent() *BinarySearchTreeNode[T]

+ func (node *BinarySearchTreeNode[T]) Predecessor() *BinarySearchTreeNode[T]

+ func (node *BinarySearchTreeNode[T]) Right() *BinarySearchTreeNode[T]

+ func (node *BinarySearchTreeNode[T]) Size() int

+ func (node *BinarySearchTreeNode[T]) Successor() *BinarySearchTreeNode[T]