Create a Red-Black Tree and optionally bulk-insert items.
New RedBlackTree instance.
Gets the color of the node (used in Red-Black trees).
The node's color.
Sets the color of the node.
The new color.
Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
The subtree node count.
Sets the count of nodes in the subtree.
The new count.
Gets the position of the node relative to its parent.
The family position (e.g., 'ROOT', 'LEFT', 'RIGHT').
Gets the height of the node (used in self-balancing trees).
The height.
Sets the height of the node.
The new height.
Get the left child pointer.
Left child node, or null/undefined.
Set the left child and update its parent pointer.
New left node, or null/undefined.
void
Get the right child pointer.
Right child node, or null/undefined.
Set the right child and update its parent pointer.
New right node, or null/undefined.
void
Represents a Node in a Binary Search Tree.