Trie

Trie Data Structure: Explanation and Examples

What is Trie? Trie is a sort of k-ary search tree that is used to store and search for a certain key in a set. Search complexity can be reduced to an ideal level using Trie (key length). A well-balanced BST will require time proportional to M * log N if

Blog | Board Infinity
Blog | Board Infinity
Trie