June 2018
Intermediate to advanced
316 pages
6h 34m
English
A trie data structure stores data step by step. Tries can be extremely useful for implementing autocomplete. Unlike a binary search tree, the position of the node in the tree defines the key with which it is associated. Usually, a string is used as a key for this data structure. The Kotlin standard library and JDK don't contain an implementation of this data structure:

The cost of searching for a word or prefix is fixed and depends only on the number of characters.
Read now
Unlock full access