A practice implementation of merkle trees in Scala. I was inspired by the Dynamo paper.
Construct a new Merkle tree using
val tree = MerkleTree(data, digest)tree#hash- returnsArray[Byte]tree#left- returnsMerkleTreetree#right- returnsMerkleTree
- findDifference(left, right): Node # lowest nodeTBD
TBD