Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security Policy
  
  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

binary_tree_ts

package

Go to main page

Versions in this module

v0

v0.0.15

Nov 11, 2024

v0.0.14

Mar 24, 2024

v0.0.12

Mar 9, 2024

v0.0.11

Feb 20, 2024

v0.0.10

Jan 14, 2024

v0.0.9

Jan 12, 2024

v0.0.8

Jan 12, 2024

v0.0.7

Apr 16, 2023

v0.0.6

Apr 2, 2023

Changes in this version

+ type ApplyFunction func(pos, depth int, data *T, userData interface{}) bool

+ type BinaryTree struct

+ func NewBinaryTree() *BinaryTree[T]

+ func (tt *BinaryTree[T]) Delete(find *T) (found bool)

+ func (tt *BinaryTree[T]) DeleteAtHead() (found bool)

+ func (tt *BinaryTree[T]) DeleteAtTail() (found bool)

+ func (tt *BinaryTree[T]) DeleteMatch(find *T, fx func(a, b *T) int) (found bool)

+ func (tt *BinaryTree[T]) Depth() (d int)

+ func (tt *BinaryTree[T]) Dump(fo io.Writer)

+ func (tt *BinaryTree[T]) FindMax() (item *T)

+ func (tt *BinaryTree[T]) FindMin() (item *T)

+ func (tt *BinaryTree[T]) Front() (rv *BinaryTreeIter[T])

+ func (tt *BinaryTree[T]) Index(pos int) (item *T)

+ func (tt *BinaryTree[T]) Insert(item *T) (vv bool)

+ func (tt *BinaryTree[T]) IsEmpty() bool

+ func (tt *BinaryTree[T]) Len() int

+ func (tt *BinaryTree[T]) Length() int

+ func (tt *BinaryTree[T]) Reverse()

+ func (tt *BinaryTree[T]) Search(find *T) (item *T)

+ func (tt *BinaryTree[T]) Truncate()

+ func (tt *BinaryTree[T]) WalkFunc(Fx func(a *T))

+ func (tt *BinaryTree[T]) WalkInOrder(fx ApplyFunction[T], userData interface{})

+ func (tt *BinaryTree[T]) WalkPostOrder(fx ApplyFunction[T], userData interface{})

+ func (tt *BinaryTree[T]) WalkPreOrder(fx ApplyFunction[T], userData interface{})

+ type BinaryTreeElement struct

+ func (ee *BinaryTreeElement[T]) GetData() *T

+ func (ee *BinaryTreeElement[T]) SetData(x *T)

+ type BinaryTreeIter struct