Edited ch11_blockchain.adoc with Atlas code editor

7 months ago · 28d5af0f9d
parent 1947acfad2
commit 28d5af0f9d
1 changed files with 1 additions and 1 deletions
--- a/ch11_blockchain.adoc
+++ b/ch11_blockchain.adoc
@ -424,7 +424,7 @@ image::images/mbc3_1102.png["merkle_tree"]
 Because the merkle tree is a binary tree, it needs
 an even number of leaf nodes. If there are an odd number of transactions
 to summarize, the last transaction hash will be duplicated to create an
-even number of leaf nodes, also known ((("balanced trees")))as a _balanced tree_. This is
+even number of leaf nodes, also known ((("balanced merkle trees")))as a _balanced tree_. This is
 shown in <<merkle_tree_odd>>, where transaction C is duplicated.
 Similarly, if there are an odd number of hashes to process at any level,
 the last hash is duplicated.