 The value for each inner node of the tree is the hash of the concatenation of its two children.For example, formula_14 and formula_15.In this way, a tree with formula_9 leaves and formula_17 nodes is built.