Trie
id:
trie-174-1922905
title:
Trie
text:
In computer science, a trie, also called digital tree or prefix tree, is a type of k-ary search tree, a tree data structure used for locating specific keys from within a set. These keys are most often strings, with links between nodes defined not by the entire key, but by individual characters. In order to access a key, the trie is traversed depth-first, following the links between nodes, which represent each character in the key. Unlike a binary search tree, nodes in the trie do not store their
brand slug:
wiki
category slug:
encyclopedia
description:
K-ary search tree data structure
original url:
https://en.wikipedia.org/wiki/Trie
date created:
2001-12-10T01:35:44Z
date modified:
2024-09-02T14:26:01Z
main entity:
{"identifier":"Q387015","url":"https://www.wikidata.org/entity/Q387015"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/b/be/Trie_example.svg","width":400,"height":375}
fields total:
13
integrity:
16