trie search

Show Summary Details

Quick Reference

A searching algorithm that examines data stored in a trie (name derived from information re trieval). A trie is essentially an n-ary tree with nodes that are n-place vectors, the components of which correspond to digits or characters.

Subjects: Computing.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.