We characterize the expressive power of EX, EF and EX+EF logics. These are the fragments of CTL build using the respective operators. We give a forbidden pattern characterization of the languages definable in these logics. The characterizations give optimal algorithms for deciding if a given tree language is expressible in one of the three logics.