Actually function-tree is an application of Boolean theory.Function-tree can be optimized by using absorptive law and idempotent law in Boolean algebra to remove redundant information.

• 功能树本质上可视为是布尔代数理论的一种应用，从而利用布尔代数的吸收律、幂等律来消除功能树中的冗余信息，对功能树进行优化处理。