http://invest2nfeyjkatnooazw3uyoql55n2n7jlzduskc6tthzgshp3pvrid.onion/ethereum-tokens/index8.html
Bitcoin uses essentially the data structure in Haber and Stornetta's 1991 and 1997 papers, shown in simplified form in Figure 2 (Nakamoto was presumably unaware of Benaloh and de Mare's work). Of course, in bitcoin, transactions take the place of documents. In each block's Merkle tree, the leaf nodes are transactions, and each internal node essentially consists of two pointers.