Too Long; Didn't Read
In computer science, a tree is a data structure composed out of nodes. It is composed of edges and nodes, which are also known as edges. In a merkle tree, every leaf contains the signature of a cryptographic hash (the one-way of a hash) This turns out to be a very interesting way of storing data. Particularly speaking it is commonly used for representing hierarchical data, since it has a certain structure storing data for efficient searches and more. A hash is basically a signature of any kind of arbitrary data. In order to have a good, unique signature we want the chance of getting any output (of the fixed size) roughly the same.