Alternating-sum criterion for decision-tree evasiveness (${\sum }_x(-1{)}^{\mathrm{wt}(x)}f(x)\ne 0⟹D(f)=n$)

A leaf reached before all $n$ input bits are queried leaves at least one coordinate free. Flipping that coordinate pairs its inputs with opposite alternating signs and equal output. Thus every such leaf contributes zero. If the total alternating sum is nonzero, a depth below $n$ is impossible.