 An ADTree consists of an alternation of decision nodes, which specify a predicate condition, and prediction nodes, which contain a single number.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.ADTrees were introduced by Yoav Freund and Llew Mason.