Returns true if key presents in Trie , else false
static void search ( TrieNode root , String key , int id ) { TrieNode pCrawl = root ; for ( int level = 0 ; level < key . length ( ) ; level ++ ) { int index = key . charAt ( level ) - ' a ' ;