public boolean search(String word) {
            TrieNode current = root;
            for (int i = 0; i < word.length(); i++) {
                char ch = (char)(word.charAt(i) - 'a');
                if (current.child[ch] == null) {
                    return false;
                }
                current = current.child[ch];
            }
            return current.isWord;
        }
Date 03/04/2016
@author Tushar Roy

Search for dictionary words in the board.
Idea is to use trie for the dictionary which keeps search
very efficient.

https://leetcode.com/problems/word-search-ii/
src/com/interview/graph/Boggle.java