A new algorithm for Algorithm Tree complement function is proposed. This paper exposes an underlying unification of the existing complementation algorithms. It is proven that unate complementation and sharp are the same as DeMorgan Law algorithm and disjoint sharp is a special case of the recursive method; 阐述了已有的求补运算算法的潜在统一性,证明了单边求补算法、sharp算法与德·摩根律是等效的算法;