next commit

Author: shashankch

src/tries/impl.java

@@ -0,0 +1,69 @@
+package tries;
+
+// dictionary;
+// add,search and remove
+
+
+// here if we use hashmap then complexity is O(1) in avg case. and it is independent of
+// entries in the hashmap..
+// in hashmap we calculate hashcode for this takes time equal to word length for every opn.
+class TrieNode {
+
+    char data;
+    boolean isTerminating;
+    TrieNode children[];
+
+    public TrieNode(char data) {
+
+        this.data = data;
+        isTerminating = false;
+        children = new TrieNode[26];
+
+    }
+
+
+}
+
+
+public class impl {
+
+    TrieNode root;
+
+    public impl() {
+
+        root = new TrieNode('\0');
+    }
+
+
+    private void add(TrieNode root, String word) {
+
+
+        if (word.length() == 0) {
+
+            root.isTerminating = true;
+            return;
+        }
+
+
+        int childIndex = word.charAt(0) - 'a';
+        TrieNode child = root.children[childIndex];
+        if (child == null) {
+            child = new TrieNode(word.charAt(0));
+            root.children[childIndex] = child;
+        }
+
+        add(child, word.substring(1));
+
+    }
+
+
+
+    public void add(String word) {
+        add(root, word);
+
+
+    }
+
+
+
+}