On functions computed on trees

Understand

Any function can be constructed using a hierarchy of simpler functions through compositions.

• Such a hierarchy can be characterized by a binary rooted tree.
• Each node of this tree is associated with a function which takes as inputs two numbers from its children and produces one output.
• Since thinking about functions in terms of computation graphs is getting popular we may want to know which functions can be implemented on a given tree.