Also known as red-black tree, red black tree, symmetric binary B-trees, RB tree
self-balancing binary search tree data structure
via Wikipedia infobox
~40 min read
Example of a red-black tree
In computer science, a red–black tree is a self-balancing binary search tree data structure noted for fast storage and retrieval of ordered information. The nodes in a red-black tree hold an extra "color" bit, often drawn as red and black, which help ensure that the tree is always approximately balanced.
via Wikidata sitelinks · CC0
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).