bst

package
v0.0.0-...-3a7704f Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Apr 6, 2023 License: MIT Imports: 1 Imported by: 0

Documentation

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type BinarySearchTree

type BinarySearchTree struct {
	// contains filtered or unexported fields
}

func NewBinarySearchTree

func NewBinarySearchTree() *BinarySearchTree

func (*BinarySearchTree) Add

func (bst *BinarySearchTree) Add(value int)

func (*BinarySearchTree) Find

func (bst *BinarySearchTree) Find(value int) *Node

func (*BinarySearchTree) FindMaxHeight

func (bst *BinarySearchTree) FindMaxHeight() int

func (*BinarySearchTree) FindMinHeight

func (bst *BinarySearchTree) FindMinHeight() int

func (*BinarySearchTree) InOrderTraversal

func (bst *BinarySearchTree) InOrderTraversal() []int

func (*BinarySearchTree) IsBalanced

func (bst *BinarySearchTree) IsBalanced() bool

func (*BinarySearchTree) IsPresent

func (bst *BinarySearchTree) IsPresent(value int) bool

func (*BinarySearchTree) LevelOrderTraversal

func (bst *BinarySearchTree) LevelOrderTraversal() []int

func (*BinarySearchTree) Max

func (bst *BinarySearchTree) Max() int

func (*BinarySearchTree) Min

func (bst *BinarySearchTree) Min() int

func (*BinarySearchTree) PostOrderTraversal

func (bst *BinarySearchTree) PostOrderTraversal() []int

func (*BinarySearchTree) PreOrderTraversal

func (bst *BinarySearchTree) PreOrderTraversal() []int

func (*BinarySearchTree) Remove

func (bst *BinarySearchTree) Remove(value int)

type Node

type Node struct {
	// contains filtered or unexported fields
}

func NewNode

func NewNode(value int) *Node

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL