Trie Cleanup

Author: Deepak Malik

src/com/deepak/data/structures/Trie/TrieImplementation.java

@@ -28,9 +28,11 @@ public TrieImplementation() {
 
 	/**
 	 * Method to insert a word in Trie
+	 * 
 	 * @param word
 	 */
 	public void insert(String word) {
+		/* Find the children of root node */
 		HashMap<Character, TrieNode> children = root.children;
 		for (int i = 0; i < word.length(); i++) {
 			char character = word.charAt(i);
@@ -50,6 +52,7 @@ public void insert(String word) {
 
 	/**
 	 * Method to check if a word in Trie starts with the given prefix
+	 * 
 	 * @param prefix
 	 * @return {@link boolean}
 	 */
@@ -62,6 +65,7 @@ public boolean startsWith(String prefix) {
 
 	/**
 	 * Method to search TrieNode based on the word
+	 * 
 	 * @param word
 	 * @return {@link TrieNode}
 	 */
@@ -82,6 +86,7 @@ public TrieNode searchNode(String word) {
 
 	/**
 	 * Method to search the given word in the Trie
+	 * 
 	 * @param word
 	 * @return {@link boolean}
 	 */

test/com/deepak/data/structures/Trie/TrieTest.java

@@ -1,5 +1,5 @@
 /**
- * Data-Structures-in-Java
+ * Data-Structures-In-Java
  * TrieTest.java
  */
 package com.deepak.data.structures.Trie;