Trie

In computer science, a trie is a type of tree (data structure). A trie is often used to store a set. Common prefixes among items within the trie are stored only once.

A trie containing "Java", "Rad", "Rand", "Rau", "Raum", and "Rose".

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.