Review: Trie Tree Problems

Trie tree is good at prefix-searching requirements.

Key operations: insert, search, prefix, getHeight, etc.



Key Points:

  • 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

See more blog_posts.

linkedin
github
slack

Share It, If You Like It.

Leave a Reply

Your email address will not be published.