Back to all docs
API Reference / Telerik.Collections.Generic / Overview

Telerik.Collections.Generic

Class
AvlIndex<T>
Class
AvlTree<ValueT>
Class
AvlTreeNode<ValueT>
Class
HybridIndex<T>
Interface
IAvlEnumerator<ValueT>
Interface
IOrderedTree<T>

Interface to the tree which supports direct access to the items

Interface
ISortedTree<T>

Interface to the tree

Interface
ITree<T>

Interface to the tree

Interface
ITreeNode<T>

Interface to the node

Class
Index<T>
Class
ItemNotifyCollection<T>

Represents a collection that provides notifications when items are added, removed, or when individual items' properties change.

Class
ListIndex<T>
Class
NotifyCollection<T>

Represents a collection that provides notifications when items are added, removed, or when the list is refreshed.

Class
ObservableHashSet<T>

An observable collection that ensures all items are unique, similar to a HashSet but with change notifications.

Class
RBMultiTree<T>

Non-unique RBMultiTree

Class
RBOrderedMultiTree<T>

Non-unique RBMultiTree

Struct
RBOrderedNodeParam

Parameters of ordered node

Class
RBOrderedTree<T>

Unique ordered RBTree

Class
RBOrderedTreeBase<T>

Basic RBTree with ordering

Operation like Add and Remove are an O(2logN) operations. Operation Find is O(logN) operation.

Class
RBOrderedTreeNode<T>

Ordered node

Class
RBTree<T>

Unique RBTree

Class
RBTreeBase<T, N, P>

Base class for the tree. Based on the Damian Ivereigh implementation Support for the multi-trees has been added. Do not use this class directly. Use RBTree, RBMultiTree, RBOrderedTree and RBOrderedMultiTree classes

Enum
RBTreeColor

Colour of the node

Class
RBTreeIndex<T>
Class
RBTreeNode<T>

Tree node

Class
RBTreeNodeBase<T, P>

Node of the red-black tree

Not finding the help you need?
Contact Support