@@ -5,22 +5,24 @@ _Read this in other languages:_
55[ _ Русский_ ] ( README.ru-RU.md ) ,
66[ _ Português_ ] ( README.pt-BR.md )
77
8- In computer science, a ** trie** , also called digital tree and sometimes
9- radix tree or prefix tree (as they can be searched by prefixes),
10- is a kind of search tree—an ordered tree data structure that is
11- used to store a dynamic set or associative array where the keys
12- are usually strings. Unlike a binary search tree, no node in the
13- tree stores the key associated with that node; instead, its
8+ In computer science, a ** trie** , also called digital tree and sometimes
9+ radix tree or prefix tree (as they can be searched by prefixes),
10+ is a kind of search tree—an ordered tree data structure that is
11+ used to store a dynamic set or associative array where the keys
12+ are usually strings. Unlike a binary search tree, no node in the
13+ tree stores the key associated with that node; instead, its
1414position in the tree defines the key with which it is associated.
1515All the descendants of a node have a common prefix of the string
16- associated with that node, and the root is associated with the
17- empty string. Values are not necessarily associated with every
18- node. Rather, values tend only to be associated with leaves,
19- and with some inner nodes that correspond to keys of interest.
20- For the space-optimized presentation of prefix tree, see compact
16+ associated with that node, and the root is associated with the
17+ empty string. Values are not necessarily associated with every
18+ node. Rather, values tend only to be associated with leaves,
19+ and with some inner nodes that correspond to keys of interest.
20+ For the space-optimized presentation of prefix tree, see compact
2121prefix tree.
2222
23- ![ Trie] ( https://upload.wikimedia.org/wikipedia/commons/b/be/Trie_example.svg )
23+ ![ Trie] ( ./images/trie.jpg )
24+ 25+ * Made with [ okso.app] ( https://okso.app ) *
2426
2527## References
2628
0 commit comments