# Computation tree

In a computation tree each output node is labeled Yes or No. If a tree, T, with an input space X, if $x \in X$ and the path for x ends in node labeled yes, then the input x is accepted. Else it is rejected.