Discover published sets by community

A self-balancing tree data structure that maintains sorted data and allows searches, insertions, and deletions in logarithmic time. It's commonly used in databases and file systems.

A specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key of P is either greater than or equal to (in a max heap) or less than or equal to (in a min heap) the key of C.

A type of self-balancing binary search tree where each node has an extra bit representing 'color' (red or black) to ensure balance during insertions and deletions.

A tree data structure in which each node has at most two children, referred to as the left child and the right child.

A self-balancing binary search tree where the height difference between left and right subtrees (the balance factor) is at most one for all nodes.

A binary tree where for every node, values in its left subtree are less than its own value, and values in the right subtree are greater.