binary

package

v0.0.0-...-9b8d98b Latest Latest Go to latest Published: Oct 4, 2021 License: MIT Imports: 1 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

This section is empty.

This section is empty.

This section is empty.

type BinTree struct {
	Element
}

BinTree represents a binary tree. The zero value for tree is an empty tree ready to use.

func New(v interface{}) *BinTree

New returns an empty tree

func (b *BinTree) Depth() int

Depth return the depth

func (b *BinTree) Init() *BinTree

Init initializes a tree.

func (b *BinTree) InorderTraverse(visit func(e *Element))

func (b *BinTree) InorderTraverseIteration(visit func(e *Element))

func (b *BinTree) LevelorderTraverse(visit func(e *Element))

func (b *BinTree) PostorderTraverse(visit func(e *Element))

func (b *BinTree) PostorderTraverseIteration(visit func(e *Element))

func (b *BinTree) PreorderTraverse(visit func(e *Element))

PreorderTraverse visit element with recursive pre-order

func (b *BinTree) PreorderTraverseIteration(visit func(e *Element))

type Element struct {

	// The value stored with this element.
	Value interface{}
	// contains filtered or unexported fields
}

Element is an element of a binary tree.

func NewElement(v interface{}) *Element

func (e *Element) Left() *Element

Left returns the left child or nil.

func (e *Element) Right() *Element

Right returns the right child or nil.