Class RedBlackTreeLinked<T, TCompare>

A self sorting binary tree using the red-black tree algorithms.

Inheritance
System.Object
RedBlackTreeLinked<T, TCompare>
Namespace: Towel.DataStructures
Assembly: Towel.dll
Syntax
public class RedBlackTreeLinked<T, TCompare> : object, IRedBlackTree<T, TCompare>, IRedBlackTree<T>, ISortedBinaryTree<T, TCompare>, ISortedBinaryTree<T>, IDataStructure<T>, ISteppable<T>, System.Collections.Generic.IEnumerable<T>, DataStructure.IAddable<T>, DataStructure.IRemovable<T>, DataStructure.ICountable, DataStructure.IClearable, DataStructure.IAuditable<T>, DataStructure.IComparing<T, TCompare>, ICloneable<RedBlackTreeLinked<T, TCompare>> where TCompare : struct, IFunc<T, T, CompareResult>
Type Parameters
Name Description
T

The type of values stored in this data structure.
TCompare

The type that is comparing T values.

Constructors

| Improve this Doc View Source

RedBlackTreeLinked(TCompare)

Constructs a new Red Black Tree.

Declaration
public RedBlackTreeLinked(TCompare compare = default(TCompare))
Parameters
Type Name Description
TCompare compare

The comparison method to be used when sorting the values of the tree.

Implements

System.Collections.Generic.IEnumerable<>