Merkle Trees....continued (#4)

Hey folks, we’re back for another post. Today, as promised in the previous post, we’ll be implementing Merkle Trees. I will do my best to provide the implementation in multiple languages. Note: I’m currently trying to get better at Golang so I’ll be implementing the tree in that. Subscribe now Shout-outs We’ve gone from 48 subscribers last week to 57 this week. I’m beyond grateful for all the subscribers. Hopefully you all are enjoying the content. I’ve gotten a few requests from subscribers and I’d like to see what folks want to see more of: Recap Let’s quickly recap what we discussed last time. We talked about the tree data structure and how it represents a hierarchy consisting of nodes classified as root, children, and leaf. We then went on to define and discuss a special type of tree, a Merkle tree. We defined a Merkle tree as a binary tree in which every leaf node contains the cryptographic hash of a data element while every non-leaf node contains the cryptographic hash of the sum