symmetric binary B-tree

E2172203 UNEXPLORED

Symmetric binary B-tree is the original name for the self-balancing binary search tree data structure now commonly known as a red-black tree.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label Occurrences
symmetric binary B-tree canonical 1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

red-black tree → originalName → symmetric binary B-tree ⓘ