A simple R-based implementation of a Trie (a.k.a. digital tree/radix tree/prefix tree) A trie, also called digital tree and sometimes radix tree or prefix tree is a kind of search tree. This ordered tree data structure is used to store a dynamic set or associative array where the keys are usually strings.
|Maintainer||Casimir Saternos <email@example.com>|
|License||MIT + file LICENSE|
|Package repository||View on GitHub|
Install the latest version of this package by entering the following in R:
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.