Trie/ Prefix Tree

✅ Trie = Prefix Tree

TRIEval: finding something or obtaining it
tree-like data structure
efficient storing, retrieval of key-value pairs
prefix-based searching

trie is String searching

👎🏻 in binary search tree, searching integer time-complexity is O(logN)
👎🏻 in binary search tree, searching string time-complexity is O(M*logN)
👍🏻 in trie, searching string time-complexity is O(M)