A Trie is used to store dictionary words so that they can be searched efficiently and prefix search can be done. The task is to write a function to count the number of words.
Input : root / \ \ t a b | | | h n y | | \ | e s y e / | | i r w | | | r e e | r Output : 8 Explanation : Words formed in the Trie : "the", "a", "there", "answer", "any", "by", "bye", "their".
In Trie structure, we have a field to store end of word marker, we call it isLeaf in below implementation. To count words, we need to simply traverse the Trie and count all nodes where isLeaf is set.
This article is contributed by Rohit Thapliyal. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Counting number of lines, words, characters and paragraphs in a text file using Java
- Sorting array of strings (or words) using Trie
- Sorting array of strings (or words) using Trie | Set-2 (Handling Duplicates)
- Rencontres Number (Counting partial derangements)
- Check if the given string of words can be formed from words present in the dictionary
- Count words that appear exactly two times in an array of words
- Program to convert a given number to words | Set 2
- Program to convert a given number to words
- Lex Program to count number of words
- Number of words in a camelcase sequence
- Reverse String according to the number of words
- Print number of words, vowels and frequency of each character
- Boggle | Set 2 (Using Trie)
- Trie | (Delete)
- Trie | (Insert and Search)