To which data structure group do red-black trees belong?

Red-black trees belong to the group of balanced binary search trees (self-balancing binary search trees). These are data structures that maintain the order of elements and provide logarithmic time complexity for insertion, deletion, and search operations.

A red-black tree uses color labels (red or black) for nodes and a set of rules that ensure the tree remains balanced after modifications. This allows operations to be performed efficiently even in the worst cases.