From 28d5af0f9d4a6e9feb36b3d333a30a322748b64e Mon Sep 17 00:00:00 2001
From: clenser <c_lenser@hotmail.com>
Date: Fri, 27 Oct 2023 18:54:12 +0000
Subject: [PATCH] Edited ch11_blockchain.adoc with Atlas code editor

---
 ch11_blockchain.adoc | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/ch11_blockchain.adoc b/ch11_blockchain.adoc
index d124776e..a5a04dca 100644
--- 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.