Trie - code review request for improvement
The TrieNode[] alphabets can probably be changed to a Map&lt;Character, TrieNode&gt;.

This would have some important advantages: 


First, you would not consume all characters domain space (256 in your sample code) unless you actually have nodes defined for all of them. 
Second, if you use a HashMap or LinkedHashMap as implementation, the search algorithm is pretty fast, you won't have to iterate over the entire collection to find an element since the search is based on hashes. 
Third, it will make it simpler to improve your code when you want to support other languages out there using more than just 256 characters.