public TrieNode search(String word){
        TrieNode location = root;

        int char_code;

        for(int i = 0; location != null && i < word.length(); i++) {
            char_code = word.charAt(i) - 'a';

            location = location.getBranch(char_code);
        }
        if(location != null && location.getFlag()) {

            return location;
        }
        return null;
    }