This picture/multimedia file is now available on Wikimedia Commons as Trie example.svg. Images which have been tagged with this template may be deleted immediately after satisfying these conditions (CSD I8).
Example of a trie. Image File history File links Commons-logo. ... Image File history File links Example of a trie, for the trie page. ... A trie for keys to, tea, ten, i, in, and inn. In computer science, a trie, or prefix tree, is an ordered tree data structure that is used to store an associative array where the keys are strings. ...
I, the creator of this work, hereby release it into the public domain. This applies worldwide. In case this is not legally possible, I grant any entity the right to use this work for any purpose, without any conditions, unless such conditions are required by law. Image File history File links PD-icon. ...
File history
Legend: (cur) = this is the current file, (del) = delete this old version, (rev) = revert to this old version. Click on date to download the file or see the image uploaded on that date.
(del) (cur) 06:40, 15 July 2006 . . Booyabazooka (Talk | contribs) . . 400×375 (17,038 bytes) (:''Original raster version:
:Image:Trie example.png'' Example of a trie. {{pd-self}})
Edit this file using an external application
See the setup instructions for more information. Image File history File links Example of a trie, for the trie page. ... A trie for keys to, tea, ten, i, in, and inn. In computer science, a trie, or prefix tree, is an ordered tree data structure that is used to store an associative array where the keys are strings. ...
File links
The following pages on the English Wikipedia link to this file (pages on other projects are not listed):
Feeds |
Contact