Trie data structure in Java
TrieContainer[26] contains a magic number. Since we can calculate with char I'd write TrieContainer['Z' - 'A' + 1] to make it clear.

I'd use System.out.printf("\n%b", isWordPresent(start, "abcd")) rather than string concatenation System.out.println("\n"+isWordPresent(start, "abcd")).

I'd let if follow by a space to distinguish it from method invocations (as you do it with for). I'd also surround else with spaces.

You're inconsistent in surrounding operators with spaces or not. Do the former.

I'd rename isFound to isWordFound.

Since the variables character are just local to for I'd call them just ch.

character-97 can be replaced with ch - 'a' then.

Array indices can be char, too. So:

for (int i = 0; i &lt; start.series.length; i++) {
    ...
    ... (char)(97+i));


... can be changed to:

for (char ch = 0; ch &lt; start.series.length; ch++) {
    ...
    ... (ch + 'a'));


I think start isn't an ideal name. With this if(start.isEnd) looks somehow irritating.

Having just static methods in Trie and public variables in TrieContainer doesn't look well-designed.