### Python 中哈希树的实现 在Python中，可以通过构建一个简单的哈希树（Hash Tree 或 Merkle Tree）来处理数据验证等问题。下面是一个基于二叉树结构的哈希树实现示例： ```python import hashlib def hash_data(data): sha = hashlib.sha256() sha.update(data.encode('utf-8')) return sha.hexdigest() class TreeNode: def __init__(self, value=None): self.left = None self.right = None self.value = value def compute_hash(self): if not self.left and not self.right: if self.value is None: self.value = '' self.hash_value = hash_data(str(self.value)) else: self.hash_value = hash_data(self.left.hash_value + self.right.hash_value) def build_merkle_tree(leaves): nodes = [TreeNode(value=leaf) for leaf in leaves] while len(nodes) != 1: temp = [] for i in range(0, len(nodes), 2): node1 = nodes[i] if i+1 < len(nodes): node2 = nodes[i+1] else: node2 = TreeNode() # 如果只有一个子节点，则另一个为空 parent = TreeNode() parent.left = node1 parent.right = node2 parent.compute_hash() temp.append(parent) nodes = temp root_node = nodes[0] root_node.compute_hash() return root_node if __name__ == "__main__": transactions = ["tx_1", "tx_2", "tx_3", "tx_4"] merkle_root = build_merkle_tree(transactions).hash_value print("Merkle Root:", merkle_root) ``` 此代码片段展示了如何利用SHA-256散列函数创建一个简单的哈希树[^2]。