canopy

README

Canopy

A collection of tree data structures. This is a repo for learning how structure go projects.

Package binary

Contains a collection of binary trees.

Example usage:

tree := binary.NewBinarySearchTree[int]()
binary.InsertAll(tree, 3, 2, 4)
printer := func(n binary.Node[int]) bool {
fmt.Println("node value: ", n.Value())
return true
}
tree.Traverse(binary.InOrder[int], printer)

Binary Search Tree

A standard binary search tree.

Resources

• https://www.cs.usfca.edu/~galles/visualization/SplayTree.html

Splay Tree

A Splay Tree is a binary tree which has the following properties:

• Binary tree
• Not necessarily balanced
• Any node with the most recent access is brought to the root

Resources

• https://www.cs.usfca.edu/~galles/visualization/SplayTree.html
• Adam Gaweda's Splay Tree Lectures

Red Black Tree

A self-balancing binary tree.

Resources

https://www.cs.usfca.edu/~galles/visualization/RedBlack.html

• Michael Sambol's videos on Red-Black Trees

Documentation

Index

• type Tree

Types

type Tree

type Tree[E cmp.Ordered] interface {
	// Insert Places a value into the tree.
	// Returns true if the value was inserted, false if the value exists already.
	Insert(value E) bool

	// Delete Removes a value into the tree.
	// Returns true if the value was removed.
	Delete(value E) bool

	// Find Returns true if a value exists in the tree.
	Find(value E) bool
}

Tree The interface for all tree types.