Radix tree

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class

Notion

Domain

Science and technology

In collections

Nobody has pulled it yet.

What Wikipedia says

In computer science, a radix tree (also radix trie or compact prefix tree or compressed trie) is a data structure that represents a space-optimized trie (prefix tree) in which each node that is the only child is merged with its parent.

Excerpt from the Wikipedia article “Radix tree”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: Shyamal based on request at Commons:Graphic_Lab/Illustration_workshop#Patricia_trie_–_complicate_data_structure, CC0, via Wikimedia Commons.