How to implement Prefix Tree in Java

Comment hidden because of low score. Click to expand.
of 0 vote

Let me sketch some sample code for ASCII:

public class TrieNode {
	public final TrieNode[] 	children = (TrieNode[]) new Object[128];
	public boolean isWord = false;

For insertion, follow the trie by characters, if a child for some character is null, create a new node and link parent to it. If you reach the final character mark 'isWord = true' (or if you query a word return isWord at terminal node). I hope it will help.

- autoboli January 29, 2015 | Flag Reply

Add a Comment

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.


is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More


CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More