Decision tree

Suppose you have two sets and . A decision tree is a representation of a function , it is comprised of,

  • a rooted tree ,
  • for each parent mapping , and
  • a mapping .

To evaluate compute the path with , then if compute with with .