bst

Documentation

Index

• func IterOnTree(n *Node, f func(*Node)) bool
• type Node
  • func NewNode(i int) *Node
  • func (n *Node) Compare(m *Node) int
• type Tree
  • func NewTree(n *Node) *Tree
  • func (t *Tree) Delete(i int) bool
  • func (t *Tree) Insert(i int)
  • func (t *Tree) Search(i int) *Node

Functions

func IterOnTree

func IterOnTree(n *Node, f func(*Node)) bool

Types

type Node

type Node struct {
	Value  int
	Parent *Node
	Left   *Node
	Right  *Node
}

func NewNode

func NewNode(i int) *Node

func (*Node) Compare

func (n *Node) Compare(m *Node) int

type Tree

type Tree struct {
	Head *Node
	Size int
}

func NewTree

func NewTree(n *Node) *Tree

func (*Tree) Delete

func (t *Tree) Delete(i int) bool

returns true if a node with value i was found and deleted and returns false otherwise

func (*Tree) Insert

func (t *Tree) Insert(i int)

func (*Tree) Search

func (t *Tree) Search(i int) *Node