In this paper, a kind of tree method is proposed to investigate Roos extensions about the reasoning by cases in default logic, discuss deeply the computation of Roos extensions and analyze the relationship between Roos extensions and Reiter s extensions. The algorithm decomposing the smallest set of literals from a set of clauses is presented to compute Roos extensions. The method is useful for computing Roos extensions and analyzing the complexity of reasoning by cases in default logic.