3 ms·
I think this is isomorphic to an unbalanced tree where every node has one non leaf child and one leaf child.
by tedunangst 3y ago
I think this is isomorphic to an unbalanced tree where every node has one non leaf child and one leaf child.
- r3trohack3r 3y agoSeems like claiming that a linked list isn't actually a linked list it’s an unbalanced tree where every node has one child node. I mean, you’re not wrong but it’s still a linked list. I’d be careful muddying up your mental models this way though - they’re distinct data structures for distinct purposes. You would likely not want to use a merkle tree for an append only log, and likely would not want to use a blockchain for verifying file integrity. For example, BitTorrent, IPFS, and Storj use merkle trees to verify and discover blocks on the DHT, you would not want to use a blockchain for this. And Scuttlebutt uses a blockchain as an append only log that is gossip friendly, you would not want to use a merkle tree for this.