....

Author: kaidul

.DS_Store

@@ -28,7 +28,7 @@
 + [Rabin Karp Pattern Searching](rabin_karp.cpp)
 + [Z Algorithm](z.cpp)
 + [Finite Automata Pattern Searching](Finite_Automata_Pattern_Searching.cpp)
-+ [Trie (Prefix/Radix Tree)](Trie.cpp)
++ [Trie (Prefix/Radix Tree)](algorithms/Trie.cpp)
 + [Longest Common Subsequence](lcs.cpp)
 + [Edit Distance](edit_distance.cpp)
 + [Longest Palindromic Subsequence](lps.cpp)
@@ -101,7 +101,7 @@
 + [Stack](stack.cpp)
 + [Queue](queue.cpp)
 + [List](list.cpp)
-+ [Hashtable.cpp](hashtable.cpp)
++ [Hashtable](hashtable.cpp)
 + [HashMap](hashmap.cpp)
 + [HashSet](hashset.cpp)
 + [Union Find(Disjoint Set)](union_find.cpp)

README.md

@@ -0,0 +1,52 @@
+const static int SIZE = 30;
+const static int NOT_FOUND = -1;
+class trie {
+private:
+    struct trieNode {
+        int mark;
+        trieNode* children[SIZE];
+        trieNode(): mark(NOT_FOUND) {
+            for(int i = 0; i < SIZE; ++i) {
+                children[i] = nullptr;
+            }
+        }
+        ~trieNode() {
+            for(int i = 0; i < MAX; ++i) {
+                delete children[i];
+                children[i] = nullptr;
+            }
+        }
+    };
+    trieNode* root;
+public:
+    trie(): root(new trieNode()) {
+    }
+    ~trie() {
+        delete root;
+        root = nullptr;
+    }
+    
+    void insert(string const& key, int id) {
+        trieNode* pCrawl = root;
+        for(int i = 0; i < key.length(); ++i) {
+            int indx = key[i] - 'a';
+            if(!pCrawl->children[indx]) {
+                pCrawl->children[indx] = new trieNode();
+            }
+            pCrawl = pCrawl->children[indx];
+        }
+        pCrawl->mark = id;
+    }
+    
+    int search(string const& key) {
+        trieNode *pCrawl = root;
+        for(int i = 0; i < key.length(); ++i) {
+            int indx = key[i] - 'a';
+            if(!pCrawl->children[indx]) {
+                return NOT_FOUND;
+            }
+            pCrawl = pCrawl->children[indx];
+        }
+        return pCrawl->mark;
+    }
+};