Wikis›01. Searching and Sorting›4. Tree and Indexed SearchX Fast Trie SearchSearch for an integer key in an X fast trie using hashed prefixes over a binary trie.