Trie

Rarity: Uncommon

A topic a little better known than average, read and translated beyond its own country.

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 trie (, ), also known as a digital tree or prefix tree, is a specialized search tree data structure used to store and retrieve strings from a dictionary or set. Unlike a binary search tree, nodes in a trie do not store their associated key.

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

Image: Booyabazooka (based on PNG image by Deco). Modifications by Superm401., Public domain, via Wikimedia Commons.