Classes
class	BinaryTree< T >
class	GenericNode< T >
	Represents a generic node in the collection. More...
class	GenericNodeIterator< T >
class	GroupedNode< T >
class	LinkedNode< T >
	Intrusive doubly‑linked node storing a value and two directional links. More...
class	LinkedNodeChain< T >
	Represents a chained view over multiple LinkedNodeRange<T> segments, similar to `std::views::concat` in C++. A LinkedNodeChain<T> allows iteration across several disjoint ranges of a linked Node<T> structure as if they formed one continuous sequence. More...
class	LinkedNodeIterrator< T >
	Random‑access iterator for intrusive LinkedNode<T> chains. More...
class	LinkedNodeRange< T >
struct	LinkedNodeSlice< T >
class	LinkedNodeWithSibling< T, TS >
class	Node< T >
	Intrusive singly-linked node storing a value and a single forward link. More...
class	NodeIterator< T >
	Forward iterator for intrusive singly-linked Node<T> chains. More...
class	RBTreeNode< T >
	Represents a node in a red-black tree. More...
class	Tree< T, TRE >
	Represents a generic tree structure with a specified number of child nodes. More...

Enumerations
enum	TraversOrder { TraversOrder.Preorder , TraversOrder.Inorder , TraversOrder.Postorder , TraversOrder.ListOrder , TraversOrder.ReservListOrder }
enum	TreeColor { Red , Black }

Functions
delegate bool	TraverseFunc< T > (BinaryTree< T > n, bool left, long depth)
	Represents a delegate for traversing a binary tree.

Function Documentation

◆ TraverseFunc< T >()

delegate bool SystemEx.Collections.Model.TraverseFunc< T >	(	BinaryTree< T >	n,
		bool	left,
		long	depth )

Represents a delegate for traversing a binary tree.

Parameters

n	The current node in the traversal.
left	Indicates whether the current node is a left child.
depth	The depth of the current node in the tree.

Template Parameters

T	The type of the value stored in the tree nodes.