Documentation
¶
Overview ¶
Package rbtree provides an implementation of a Red Black Tree.
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type RBIter ¶
type RBIter struct {
// contains filtered or unexported fields
}
An RBIter iterates over nodes in an RBTree
func NewRBIterAt ¶
NewRBIterAt returns an RBIter for the given tree at or immediately after the given val, or nil if the tree, or the tree's root, is nil
type RBNode ¶
type RBNode struct {
// contains filtered or unexported fields
}
An RBNode is a node in the RBTree
type RBTree ¶
type RBTree struct {
// contains filtered or unexported fields
}
An RBTree is an automatically balancing tree of KVP pairs (presumably)
func (*RBTree) Delete ¶
Delete removes a value from the RBTree Returns true on succesful deletion, false if val is not in tree
func (*RBTree) Insert ¶
Insert inserts a value and string into the tree Returns true on succesful insertion, false if duplicate exists
Source Files
Click to show internal directories.
Click to hide internal directories.