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 [ level ] - ' a ' ;