The RBTreeBase<(Of <(<'T, N, P>)>)> type exposes the following members.

Constructors

	Name	Description
	RBTreeBase<(Of <(<'T, N, P>)>)>(Boolean)	Tree constructor
	RBTreeBase<(Of <(<'T, N, P>)>)>(IComparer<(Of <<'(T>)>>), Boolean)	Tree constructor with comparer

Methods

	Name	Description
	Add	Add new key into the tree This operation is O(logN) operation
	AddOrGet	Add new key into the tree or get existing node This operation is O(logN) operation
	Balance	Balance tree past inserting
	Clear	Remove all items
	Delete	Delete the node z, and free up the space
	DeleteFix	Restore the reb-black properties after a delete
	Find	Find key in the dictionary This operation is O(logN) operation
	First	Get first node This operation is O(logN) operation
	Last	Get last node This operation is O(logN) operation
	LeftRotate	Rotate our tree Left X rb_left_rotate(X)---> Y / \ / \ A Y X C / \ / \ B C A B N.B. This does not change the ordering. We assume that neither X or Y is NULL
	NewNode	Create new node
	Next	Get next node This operation is O(logN) operation
	Predecessor	Return a pointer to the largest key smaller than x
	Previous	Get previous node This operation is O(logN) operation
	Remove(N)	Remove node from the dictionary This operation is O(1) operation
	Remove(T)	Remove key from the dictionary This operation is O(logN) operation
	RightRotate	Rotate our tree Right X Y / \ / \ A Y leftArrow--rb_right_rotate(Y) X C / \ / \ B C A B N.B. This does not change the ordering. We assume that neither X or Y is NULL
	Successor	Return a pointer to the smallest key greater than x

Fields

	Name	Description
	mCount
	mRoot
	mSyncRoot

Properties

	Name	Description
	Collection	Get collection object for this
	Count	Number of nodes in the tree
	Root	Root of the tree
	SyncRoot	Object can be used for synchronization
	Unique	Is tree unique

Explicit Interface Implementations

	Name	Description
	IEnumerable<(Of <<'(N>)>>)..::..GetEnumerator	Get enumerator
	IEnumerable..::..GetEnumerator	Get enumerator
	ISortedTree<(Of <<'(T>)>>)..::..First	Get first node
	ISortedTree<(Of <<'(T>)>>)..::..Last	Get last node
	ISortedTree<(Of <<'(T>)>>)..::..Next	Get prior node
	ISortedTree<(Of <<'(T>)>>)..::..Previous	Get next node
	ITree<(Of <<'(T>)>>)..::..Add	Add item
	ITree<(Of <<'(T>)>>)..::..AddOrGet	Add or get item
	ITree<(Of <<'(T>)>>)..::..Clear	Clear
	ITree<(Of <<'(T>)>>)..::..Find	Find item
	ITree<(Of <<'(T>)>>)..::..Remove(T)	Delete item by key
	ITree<(Of <<'(T>)>>)..::..Remove(ITreeNode<(Of <<'(T>)>>))	Delete item by key

See Also

RBTreeBase<(Of <(<'T, N, P>)>)> Class

Telerik.Collections.Generic Namespace