Resolution:
## Figure 2.
A Boolean tree for the function B_{1}(x_{1}, x_{2}, x_{3}) = (NOT x_{1}) OR (x_{2} AND x_{3}). Input variables x_{i} are connected by Boolean operators. The OR node is the root of the tree, i.e. its
value determines the value of the function represented by the tree.
Karl and Dandekar |