 This could be reduced to a single recursive function codice_1.In that case, codice_2, which could be inlined, would call codice_1, but codice_1 would only call itself.As a more general class of examples, an algorithm on a tree can be decomposed into its behavior on a value and its behavior on children, and can be split up into two mutually recursive functions, one specifying the behavior on a tree, calling the forest function for the forest of children, and one specifying the behavior on a forest, calling the tree function for the tree in the forest.