trie

Ordered tree data structure that organizes nodes by common key prefixes

EntityQ387015

Also known as digital tree · radix tree · prefix tree

Subclass of: search tree

Overview

From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0

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. Instead, each node's position within the trie determines its associated key, with the connections between nodes defined by individual characters rather than the entire key.

Overview

All data

11 statements · 27% with external sources · numbers in brackets are citations

Different from: tree applies to name of object: /ˈtriː/ · applies to name of subject: /ˈtriː/
Studied by: graph theory
computer programming
Has use: string-searching algorithm

On other databases

7 identifiers linking trie across the web's reference databases

Data quality

statements

27%

externally sourced

Source last edited January 24, 2026. AIDB refreshes this page daily.

Suggest a fact or correction

Links

Use this data

curl https://aidb.si/api/v1/entities/Q387015

API docs, limits & keys

Cite this page

AIDB. (2026). trie (Q387015). Retrieved from https://aidb.si/e/trie-Q387015