@qgambit2 Hi, but I think the worst case time (I mean, really worst) is still O(26^n), where n is Math.min(length of word, height of Trie Tree).

Though this circumstance is pretty rare (with all nodes have a fully filled set of children && input String is ".........."), but the worst case still exist. Therefore there's nothing wrong to use big O to express it.