Dictionary Tree Search lintcode topic Add and Search Word

2. Public class Worddictionary {
4. private Trienode root = new Trienode ();
8. public void Addword (String word) {
10. Map<character, trienode> children = Root.children;
12. For (int i=0; I<word.length (); i++) {
14. char c = word.charat (i);
16. Trienode T;
18. if (Children.containskey (c)) {
20. t = Children.get (c);
22. } Else {
24. t = new Trienode (c);
26. Children.put (c, t);
28. }
30. children = T.children;
32. if (i==word.length ()-1) t.leaf=true;
34. }
36. }
40. Public Boolean search (String word) {
42. return Searchnode (word, root);
44. }
48. Public Boolean searchnode (String Word, Trienode tn) {
50. if (tn==null) return false;
52. if (word.length () = = 0) return tn.leaf;
56. Map<character, trienode> children = Tn.children;
58. Trienode t = null;
60. char c = Word.charat (0);
62. if (c=='. ') {  
64. For (Char key:children.keySet ()) {
66. if (Searchnode (word.substring (1), Children.get (key)) return true;
68. }
70. return false;
72. } Else if (!children.containskey (c)) {
74. return false;
76. } Else {
78. t = Children.get (c);
80. return Searchnode (word.substring (1), T);
82. }
84. }
86. }
90. Class Trienode {
92. //Initialize your data structure here.
94. Char C;
96. Boolean leaf;
98. Hashmap<character, trienode> children = New Hashmap<character, trienode> ();
102. Public Trienode (char c) {
104. this.c = c;
106. }
110. Public Trienode () {};
112. }

Dictionary Tree Search lintcode topic Add and Search Word