 An instance is classified by an ADTree by following all paths for which all decision nodes are true and summing any prediction nodes that are traversed.This is different from binary classification trees such as CART (Classification and regression tree) or C4.5 in which an instance follows only one path through the tree.The following tree was constructed using JBoost on the spambase dataset (available from the UCI Machine Learning Repository).