In this paper we are comparing noniterated in the whole binar basis B2 = {&, ∨, ⊕}some classespowersofBooleanfunctions.Noniterated Booleanfunctions are presented with a marked root trees, in which we can pick out the a canonical forms. To continue there is an algorithm, with the help of whitch we can pass from the canonical trees to the whole binar canonical trees. In this algorithm we can combine two definitely different methods of creating the canonical form of the noniterated in the basis B2 function. The representation of the noniterated Boolean functions as a whole binar canonical trees allowed to proof, that the part of functions in canonical form of which there is one or more k-locative function &, ∨ or ⊕ exponently aspires to zero with a growth of k-value. The result is worth testing of the noniterated Boolean function.