 With these hash values formula_8 a hash tree is built, by placing these formula_9 hash values as leaves and recursively hashing to form a binary tree.Let formula_10 denote the node in the tree with height formula_11 and left-right position formula_12.Then, the hash values formula_13 are the leaves.