Class representing a Red-Black Tree data structure.
The type of values stored in the tree.
Deletes a value from the Red-Black Tree.
The value to delete.
Gets the root node of the Red-Black Tree.
The root node, or null if the tree is empty.
Performs an in-order traversal of the Red-Black Tree.
A callback function to apply to each node's value.
Inserts a value into the Red-Black Tree.
The value to insert.
Searches for a value in the Red-Black Tree.
The value to search for.
Retrieves the size of the entire tree.
Class representing a Red-Black Tree data structure.