Trie tree is good at prefix-searching requirements.
Key operations: insert, search, prefix, getHeight, etc.
- Understand why we have is_word property in the TrieNode datastructure.
Questions To Think:
Q: How to time complexity for Trie Tree problems?
The most impressive problems to me:
See all trie tree problems: #trie
- Review: Trie Tree Problems
- Leetcode: Short Encoding of Words
- Leetcode: Replace Words
- Leetcode: Prefix and Suffix Search
- Leetcode: Maximum XOR of Two Numbers in an Array
- Leetcode: Map Sum Pairs
- Leetcode: Longest Word in Dictionary
- Leetcode: Implement Trie (Prefix Tree)
- Leetcode: Implement Magic Dictionary
- Leetcode: Add and Search Word – Data structure design
See more blog_posts.